Text.ANTLR.Allstar

This module contains the glue code for hooking Sam's ParserGenerator implementation into the rest of this package.

Documentation

parse :: (Ord nts, Ord (Label t), Token t, Show nts, Show (Label t), Show t) => [t] -> GrammarSymbol nts (Label t) -> Set (ATNEdge nts (Label t)) -> Bool -> Either String (AST nts t)

Entrypoint to the ALL(*) parsing algorithm.

atnOf :: (Ord nt, Ord t, Hashable nt, Hashable t) => Grammar s nt t -> ATNEnv nt t

Go from an antlr-haskell Grammar to an Allstar ATNEnv. ALL(*) does not current support predicates and mutators.

class Token t where

Input sequence type

Associated Types

type Label t :: *

type Literal t :: *

Methods

getLabel :: t -> Label t

getLiteral :: t -> Literal t

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

type ATNEnv nt t = Set (ATNEdge nt t)

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