PP.Builder

(LA)LR

type LrTable = Map (Int, Rule) LrAction

All LR parsers have the same table format

action :: LrTable -> Int -> Rule -> LrAction

Get a LrAction from a LrTable (Rule version)

action' :: LrTable -> Int -> [OToken] -> LrAction

Get a LrAction from a LrTable (OToken version)

data LrAction

LR actions for a LR parser

Constructors

LrShift Int

LrReduce Rule

LrGoto Int

LrError

LrAccept

Instances

Eq LrAction

Methods

(==) :: LrAction -> LrAction -> Bool

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

Show LrAction

Methods

showsPrec :: Int -> LrAction -> ShowS

show :: LrAction -> String

showList :: [LrAction] -> ShowS

Binary LrAction

Methods

put :: LrAction -> Put

get :: Get LrAction

putList :: [LrAction] -> Put

type LrCollection item = Vector (LrSet item)

LR items set collection

type LrSet item = Set item

LR items set

class Ord item => LrBuilder item where

LR parser common functions

Minimal complete definition

collection, table

Methods

collection :: RuleSet -> FirstSet -> LrCollection item

Build the items set collection

table :: LrCollection item -> Either [String] LrTable

Build the parsing table

Instances

LrBuilder Lr1Item

LrBuilder instance for Lr1Item Dragon Book (2nd edition, fr), page 239, algorithm 4.53

Methods

collection :: RuleSet -> FirstSet -> LrCollection Lr1Item

table :: LrCollection Lr1Item -> Either [String] LrTable

LrBuilder LalrItem

LrBuilder instance for LalrItem

Methods

collection :: RuleSet -> FirstSet -> LrCollection LalrItem

table :: LrCollection LalrItem -> Either [String] LrTable

NFA

type NfaGraph = Gr NfaNode NfaSymbol

Nondeterministic finite automaton (NFA)

data NfaNode

NFA node type

Constructors

NfaInitial

NfaNode

NfaFinal String

Instances

Eq NfaNode

Methods

(==) :: NfaNode -> NfaNode -> Bool

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

Ord NfaNode

Methods

compare :: NfaNode -> NfaNode -> Ordering

(<) :: NfaNode -> NfaNode -> Bool

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

(>) :: NfaNode -> NfaNode -> Bool

(>=) :: NfaNode -> NfaNode -> Bool

max :: NfaNode -> NfaNode -> NfaNode

min :: NfaNode -> NfaNode -> NfaNode

Read NfaNode

Methods

readsPrec :: Int -> ReadS NfaNode

readList :: ReadS [NfaNode]

readPrec :: ReadPrec NfaNode

readListPrec :: ReadPrec [NfaNode]

Show NfaNode

Methods

showsPrec :: Int -> NfaNode -> ShowS

show :: NfaNode -> String

showList :: [NfaNode] -> ShowS

data NfaSymbol

NFA symbol type

Constructors

NfaValue Char

NfaEmpty

Instances

Eq NfaSymbol

Methods

(==) :: NfaSymbol -> NfaSymbol -> Bool

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

Ord NfaSymbol

Methods

compare :: NfaSymbol -> NfaSymbol -> Ordering

(<) :: NfaSymbol -> NfaSymbol -> Bool

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

(>) :: NfaSymbol -> NfaSymbol -> Bool

(>=) :: NfaSymbol -> NfaSymbol -> Bool

max :: NfaSymbol -> NfaSymbol -> NfaSymbol

min :: NfaSymbol -> NfaSymbol -> NfaSymbol

Read NfaSymbol

Methods

readsPrec :: Int -> ReadS NfaSymbol

readList :: ReadS [NfaSymbol]

readPrec :: ReadPrec NfaSymbol

readListPrec :: ReadPrec [NfaSymbol]

Show NfaSymbol

Methods

showsPrec :: Int -> NfaSymbol -> ShowS

show :: NfaSymbol -> String

showList :: [NfaSymbol] -> ShowS

class NfaBuilder from where

NFA builders

Minimal complete definition

buildNfa, buildNfa'

Methods

buildNfa :: from -> NfaGraph

buildNfa' :: String -> from -> NfaGraph

DFA

type DfaGraph = Gr DfaNode DfaSymbol

Deterministic finite automaton (DFA)

data DfaNode

DFA node type

Constructors

DfaInitial

DfaNode

DfaFinal String

Instances

Eq DfaNode

Methods

(==) :: DfaNode -> DfaNode -> Bool

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

Ord DfaNode

Methods

compare :: DfaNode -> DfaNode -> Ordering

(<) :: DfaNode -> DfaNode -> Bool

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

(>) :: DfaNode -> DfaNode -> Bool

(>=) :: DfaNode -> DfaNode -> Bool

max :: DfaNode -> DfaNode -> DfaNode

min :: DfaNode -> DfaNode -> DfaNode

Read DfaNode

Methods

readsPrec :: Int -> ReadS DfaNode

readList :: ReadS [DfaNode]

readPrec :: ReadPrec DfaNode

readListPrec :: ReadPrec [DfaNode]

Show DfaNode

Methods

showsPrec :: Int -> DfaNode -> ShowS

show :: DfaNode -> String

showList :: [DfaNode] -> ShowS

Binary DfaNode

Methods

put :: DfaNode -> Put

get :: Get DfaNode

putList :: [DfaNode] -> Put

Binary DfaGraph

Methods

put :: DfaGraph -> Put

get :: Get DfaGraph

putList :: [DfaGraph] -> Put

newtype DfaSymbol

DFA symbol type

Constructors

DfaValue Char

Instances

Eq DfaSymbol

Methods

(==) :: DfaSymbol -> DfaSymbol -> Bool

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

Ord DfaSymbol

Methods

compare :: DfaSymbol -> DfaSymbol -> Ordering

(<) :: DfaSymbol -> DfaSymbol -> Bool

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

(>) :: DfaSymbol -> DfaSymbol -> Bool

(>=) :: DfaSymbol -> DfaSymbol -> Bool

max :: DfaSymbol -> DfaSymbol -> DfaSymbol

min :: DfaSymbol -> DfaSymbol -> DfaSymbol

Read DfaSymbol

Methods

readsPrec :: Int -> ReadS DfaSymbol

readList :: ReadS [DfaSymbol]

readPrec :: ReadPrec DfaSymbol

readListPrec :: ReadPrec [DfaSymbol]

Show DfaSymbol

Methods

showsPrec :: Int -> DfaSymbol -> ShowS

show :: DfaSymbol -> String

showList :: [DfaSymbol] -> ShowS

Binary DfaSymbol

Methods

put :: DfaSymbol -> Put

get :: Get DfaSymbol

putList :: [DfaSymbol] -> Put

Binary DfaGraph

Methods

put :: DfaGraph -> Put

get :: Get DfaGraph

putList :: [DfaGraph] -> Put

class DfaBuilder from where

DFA builders

Minimal complete definition

buildDfa

Methods

buildDfa :: from -> DfaGraph

Orphan instances

Binary item => Binary (LrCollection item)

Methods

put :: LrCollection item -> Put

get :: Get (LrCollection item)

putList :: [LrCollection item] -> Put