PP.Rule

Canonical low-level rule

data Rule

Canonical rule type

Constructors

Rule String [Rule]

A rule is defined by a non terminal and a list of Term and NonTerm The list should end with Empty

NonTerm String

Non terminal string

Term IToken

Terminal character

TermToken String

Terminal token

Empty

Empty

Concat [Rule]

Concatenated rules, useful for PP.InputGrammar.rules

RegEx String

Regular expression, useful for lexical rules

RegExString String

No parse-string

Instances

Eq Rule

Methods

(==) :: Rule -> Rule -> Bool

(/=) :: Rule -> Rule -> Bool

Ord Rule

Methods

compare :: Rule -> Rule -> Ordering

(<) :: Rule -> Rule -> Bool

(<=) :: Rule -> Rule -> Bool

(>) :: Rule -> Rule -> Bool

(>=) :: Rule -> Rule -> Bool

max :: Rule -> Rule -> Rule

min :: Rule -> Rule -> Rule

Show Rule

Methods

showsPrec :: Int -> Rule -> ShowS

show :: Rule -> String

showList :: [Rule] -> ShowS

Binary Rule

Methods

put :: Rule -> Put

get :: Get Rule

putList :: [Rule] -> Put

uniformize :: [Rule] -> [Rule]

Uniformize a list of rules `uniformize = sort . nub . concatMap (flatten . clean)`

extend :: [Rule] -> Either String [Rule]

Generate an augmented grammar

separate :: [Rule] -> ([Rule], [Rule])

Separate rules into (parsing rules, lexing rules)

regexfy :: [Rule] -> [Rule]

Transform lexing rules to have only one RegEx on right

Canonical rules as Map

type RuleSet = Map String [[Rule]]

Rules as a map

ruleSet :: [Rule] -> RuleSet

Compute the rule set

rule :: String -> RuleSet -> [Rule]

Get rule from a RuleSet

check :: RuleSet -> ([String], [String])

Check a rule set, return: (errors, warnings)

Rules first set (Map)

type FirstSet = Map String [Rule]

First set type

firstSet :: RuleSet -> FirstSet

Compute the complete first set

first :: Rule -> FirstSet -> [Rule]

Compute first set of a given rule