Text.ANTLR.Allstar.ParserGenerator

Description

Synopsis

data GrammarSymbol nt t
- = NT nt
- | T t
- | EPS
class Token t where
- type Label t :: *
- type Literal t :: *
- getLabel :: t -> Label t
- getLiteral :: t -> Literal t
type ATNEnv nt t = Set (ATNEdge nt t)
data AST nt tok
- = Node nt [AST nt tok]
- | Leaf tok
data ATNState nt
- = Init nt
- | Middle nt Int Int
- | Final nt
type ATNEdge nt t = (ATNState nt, ATNEdgeLabel nt t, ATNState nt)
data ATNEdgeLabel nt t
- = GS (GrammarSymbol nt t)
- | PRED Bool
parse :: (Eq nt, Show nt, Ord nt, Eq (Label tok), Show (Label tok), Ord (Label tok), Token tok, Show tok) => [tok] -> GrammarSymbol nt (Label tok) -> ATNEnv nt (Label tok) -> Bool -> Either String (AST nt tok)

Documentation

Grammar symbol types

Constructors

Instances

(Eq nt, Eq t) => Eq (GrammarSymbol nt t) Source #
Instance details 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) Source #
Instance details 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) Source #
Instance details Defined in Text.ANTLR.Allstar.ParserGenerator Methods showsPrec :: Int -> GrammarSymbol nt t -> ShowS # show :: GrammarSymbol nt t -> String # showList :: [GrammarSymbol nt t] -> ShowS #

class Token t where Source #

Input sequence type

Associated Types

type Label t :: * Source #

Methods

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

data AST nt tok Source #

Return type of parse function

Constructors

Node nt [AST nt tok]
Leaf tok

Instances

(Eq nt, Eq tok) => Eq (AST nt tok) Source #
Instance details 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 (AST nt tok) Source #
Instance details Defined in Text.ANTLR.Allstar.ParserGenerator Methods showsPrec :: Int -> AST nt tok -> ShowS # show :: AST nt tok -> String # showList :: [AST nt tok] -> ShowS #

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

Constructors

Instances

Eq nt => Eq (ATNState nt) Source #
Instance details Defined in Text.ANTLR.Allstar.ParserGenerator Methods (==) :: ATNState nt -> ATNState nt -> Bool # (/=) :: ATNState nt -> ATNState nt -> Bool #
Ord nt => Ord (ATNState nt) Source #
Instance details 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) Source #
Instance details Defined in Text.ANTLR.Allstar.ParserGenerator Methods showsPrec :: Int -> ATNState nt -> ShowS # show :: ATNState nt -> String # showList :: [ATNState nt] -> ShowS #

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

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) Source #
Instance details 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) Source #
Instance details 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) Source #
Instance details Defined in Text.ANTLR.Allstar.ParserGenerator Methods showsPrec :: Int -> ATNEdgeLabel nt t -> ShowS # show :: ATNEdgeLabel nt t -> String # showList :: [ATNEdgeLabel nt t] -> ShowS #

parse :: (Eq nt, Show nt, Ord nt, Eq (Label tok), Show (Label tok), Ord (Label tok), Token tok, Show tok) => [tok] -> GrammarSymbol nt (Label tok) -> ATNEnv nt (Label tok) -> Bool -> Either String (AST nt tok) Source #

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