Text.ANTLR.Allstar.ParserGenerator

Documentation

data GrammarSymbol nt t

Grammar symbol types

Constructors

NT nt

T t

EPS

Instances

(Eq nt, Eq t) => Eq (GrammarSymbol nt t)

Defined in Text.ANTLR.Allstar.ParserGenerator

Methods

(==) :: GrammarSymbol nt t -> GrammarSymbol nt t -> Bool

(/=) :: GrammarSymbol nt t -> GrammarSymbol nt t -> Bool

(Ord nt, Ord t) => Ord (GrammarSymbol nt t)

Defined in Text.ANTLR.Allstar.ParserGenerator

Methods

compare :: GrammarSymbol nt t -> GrammarSymbol nt t -> Ordering

(<) :: GrammarSymbol nt t -> GrammarSymbol nt t -> Bool

(<=) :: GrammarSymbol nt t -> GrammarSymbol nt t -> Bool

(>) :: GrammarSymbol nt t -> GrammarSymbol nt t -> Bool

(>=) :: GrammarSymbol nt t -> GrammarSymbol nt t -> Bool

max :: GrammarSymbol nt t -> GrammarSymbol nt t -> GrammarSymbol nt t

min :: GrammarSymbol nt t -> GrammarSymbol nt t -> GrammarSymbol nt t

(Show nt, Show t) => Show (GrammarSymbol nt t)

Defined in Text.ANTLR.Allstar.ParserGenerator

Methods

showsPrec :: Int -> GrammarSymbol nt t -> ShowS

show :: GrammarSymbol nt t -> String

showList :: [GrammarSymbol nt t] -> ShowS

(Prettify nt, Prettify t) => Prettify (GrammarSymbol nt t)

Defined in Text.ANTLR.Allstar.ParserGenerator

Methods

prettify :: GrammarSymbol nt t -> Pretty

prettifyList :: [GrammarSymbol nt t] -> Pretty

type ATNEnv nt t = Set (ATNEdge nt t)

A set of ATN edges, defining the grammar over which the ALL(*) parsing algorithm operates.

data AST nt tok

Input sequence type

Return type of parse function

Constructors

Node nt [GrammarSymbol nt (Label tok)] [AST nt tok]

Leaf tok

Instances

(Eq nt, Eq tok, Eq (Label tok)) => Eq (AST nt tok)

Defined in Text.ANTLR.Allstar.ParserGenerator

Methods

(==) :: AST nt tok -> AST nt tok -> Bool

(/=) :: AST nt tok -> AST nt tok -> Bool

(Show nt, Show tok, Show (Label tok)) => Show (AST nt tok)

Defined in Text.ANTLR.Allstar.ParserGenerator

Methods

showsPrec :: Int -> AST nt tok -> ShowS

show :: AST nt tok -> String

showList :: [AST nt tok] -> ShowS

(Prettify nt, Prettify tok, Prettify (Label tok)) => Prettify (AST nt tok)

Defined in Text.ANTLR.Allstar.ParserGenerator

Methods

prettify :: AST nt tok -> Pretty

prettifyList :: [AST nt tok] -> Pretty

data ATNState nt

Specifies the nonterminal we're currently parsing as well as what state we are in for parsing some NT symbol.

Constructors

Init nt

Starting state

Middle nt Int Int

Intermediate state

Final nt

Accepting state

Instances

Eq nt => Eq (ATNState nt)

Defined in Text.ANTLR.Allstar.ParserGenerator

Methods

(==) :: ATNState nt -> ATNState nt -> Bool

(/=) :: ATNState nt -> ATNState nt -> Bool

Ord nt => Ord (ATNState nt)

Defined in Text.ANTLR.Allstar.ParserGenerator

Methods

compare :: ATNState nt -> ATNState nt -> Ordering

(<) :: ATNState nt -> ATNState nt -> Bool

(<=) :: ATNState nt -> ATNState nt -> Bool

(>) :: ATNState nt -> ATNState nt -> Bool

(>=) :: ATNState nt -> ATNState nt -> Bool

max :: ATNState nt -> ATNState nt -> ATNState nt

min :: ATNState nt -> ATNState nt -> ATNState nt

Show nt => Show (ATNState nt)

Defined in Text.ANTLR.Allstar.ParserGenerator

Methods

showsPrec :: Int -> ATNState nt -> ShowS

show :: ATNState nt -> String

showList :: [ATNState nt] -> ShowS

Prettify nt => Prettify (ATNState nt)

Defined in Text.ANTLR.Allstar.ParserGenerator

Methods

prettify :: ATNState nt -> Pretty

prettifyList :: [ATNState nt] -> Pretty

type ATNEdge nt t = (ATNState nt, ATNEdgeLabel nt t, ATNState nt)

Starting state, NT/T symbol to parse, and ending state.

data ATNEdgeLabel nt t

The domain of labels on edges in an augmented recursive transition network, namely the symbol we parse upon traversing an edge.

Constructors

GS (GrammarSymbol nt t)

The symbol to parse upon traversing an edge

PRED Bool

Unimplemented predicates in ALL(*)

Instances

(Eq nt, Eq t) => Eq (ATNEdgeLabel nt t)

Defined in Text.ANTLR.Allstar.ParserGenerator

Methods

(==) :: ATNEdgeLabel nt t -> ATNEdgeLabel nt t -> Bool

(/=) :: ATNEdgeLabel nt t -> ATNEdgeLabel nt t -> Bool

(Ord nt, Ord t) => Ord (ATNEdgeLabel nt t)

Defined in Text.ANTLR.Allstar.ParserGenerator

Methods

compare :: ATNEdgeLabel nt t -> ATNEdgeLabel nt t -> Ordering

(<) :: ATNEdgeLabel nt t -> ATNEdgeLabel nt t -> Bool

(<=) :: ATNEdgeLabel nt t -> ATNEdgeLabel nt t -> Bool

(>) :: ATNEdgeLabel nt t -> ATNEdgeLabel nt t -> Bool

(>=) :: ATNEdgeLabel nt t -> ATNEdgeLabel nt t -> Bool

max :: ATNEdgeLabel nt t -> ATNEdgeLabel nt t -> ATNEdgeLabel nt t

min :: ATNEdgeLabel nt t -> ATNEdgeLabel nt t -> ATNEdgeLabel nt t

(Show nt, Show t) => Show (ATNEdgeLabel nt t)

Defined in Text.ANTLR.Allstar.ParserGenerator

Methods

showsPrec :: Int -> ATNEdgeLabel nt t -> ShowS

show :: ATNEdgeLabel nt t -> String

showList :: [ATNEdgeLabel nt t] -> ShowS

(Prettify nt, Prettify t) => Prettify (ATNEdgeLabel nt t)

Defined in Text.ANTLR.Allstar.ParserGenerator

Methods

prettify :: ATNEdgeLabel nt t -> Pretty

prettifyList :: [ATNEdgeLabel nt t] -> Pretty

type Label tok = StripEOF (Sym tok)

parse :: forall chr tok nt. (CanParse nt tok, Prettify chr) => Tokenizer chr tok -> [chr] -> GrammarSymbol nt (Label tok) -> ATNEnv nt (Label tok) -> Bool -> Either String (AST nt tok)

ALL(*) parsing algorithm. This is not the entrypoint as used by user-facing code. See parse instead.

type Tokenizer chr tok = [chr] -> [(tok, [chr])]