Copyright	(c) 2017 Patrick Champion
License	see LICENSE file
Maintainer	chlablak@gmail.com
Stability	provisional
Portability	portable
Safe Haskell	None
Language	Haskell2010

PP.Builder

Contents

(LA)LR
NFA
DFA
Orphan instances

Description

Synopsis

(LA)LR

type LrTable = Map (Int, Rule) LrAction Source #

All LR parsers have the same table format

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

Get a LrAction from a LrTable (Rule version)

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

Get a LrAction from a LrTable (OToken version)

data LrAction Source #

LR actions for a LR parser

Constructors

LrShift Int
LrReduce Rule
LrGoto Int
LrError
LrAccept

Instances

Eq LrAction Source #
Methods (==) :: LrAction -> LrAction -> Bool # (/=) :: LrAction -> LrAction -> Bool #
Show LrAction Source #
Methods showsPrec :: Int -> LrAction -> ShowS # show :: LrAction -> String # showList :: [LrAction] -> ShowS #
Binary LrAction Source #
Methods put :: LrAction -> Put # get :: Get LrAction # putList :: [LrAction] -> Put #

type LrCollection item = Vector (LrSet item) Source #

LR items set collection

type LrSet item = Set item Source #

LR items set

class Ord item => LrBuilder item where Source #

LR parser common functions

Minimal complete definition

collection, table

Methods

collection :: RuleSet -> FirstSet -> LrCollection item Source #

Build the items set collection

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

Build the parsing table

Instances

LrBuilder Lr1Item Source #	LrBuilder instance for Lr1Item Dragon Book (2nd edition, fr), page 239, algorithm 4.53
Methods collection :: RuleSet -> FirstSet -> LrCollection Lr1Item Source # table :: LrCollection Lr1Item -> Either [String] LrTable Source #
LrBuilder LalrItem Source #	LrBuilder instance for LalrItem
Methods collection :: RuleSet -> FirstSet -> LrCollection LalrItem Source # table :: LrCollection LalrItem -> Either [String] LrTable Source #

NFA

type NfaGraph = Gr NfaNode NfaSymbol Source #

Nondeterministic finite automaton (NFA)

data NfaNode Source #

NFA node type

Constructors

NfaInitial
NfaNode
NfaFinal String

Instances

Eq NfaNode Source #
Methods (==) :: NfaNode -> NfaNode -> Bool # (/=) :: NfaNode -> NfaNode -> Bool #
Ord NfaNode Source #
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 Source #
Methods readsPrec :: Int -> ReadS NfaNode # readList :: ReadS [NfaNode] # readPrec :: ReadPrec NfaNode # readListPrec :: ReadPrec [NfaNode] #
Show NfaNode Source #
Methods showsPrec :: Int -> NfaNode -> ShowS # show :: NfaNode -> String # showList :: [NfaNode] -> ShowS #

data NfaSymbol Source #

NFA symbol type

Constructors

NfaValue Char
NfaEmpty

Instances

Eq NfaSymbol Source #
Methods (==) :: NfaSymbol -> NfaSymbol -> Bool # (/=) :: NfaSymbol -> NfaSymbol -> Bool #
Ord NfaSymbol Source #
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 Source #
Methods readsPrec :: Int -> ReadS NfaSymbol # readList :: ReadS [NfaSymbol] # readPrec :: ReadPrec NfaSymbol # readListPrec :: ReadPrec [NfaSymbol] #
Show NfaSymbol Source #
Methods showsPrec :: Int -> NfaSymbol -> ShowS # show :: NfaSymbol -> String # showList :: [NfaSymbol] -> ShowS #

class NfaBuilder from where Source #

NFA builders

Minimal complete definition

buildNfa, buildNfa'

Methods

buildNfa :: from -> NfaGraph Source #

buildNfa' :: String -> from -> NfaGraph Source #

DFA

type DfaGraph = Gr DfaNode DfaSymbol Source #

Deterministic finite automaton (DFA)

data DfaNode Source #

DFA node type

Constructors

DfaInitial
DfaNode
DfaFinal String

Instances

Eq DfaNode Source #
Methods (==) :: DfaNode -> DfaNode -> Bool # (/=) :: DfaNode -> DfaNode -> Bool #
Ord DfaNode Source #
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 Source #
Methods readsPrec :: Int -> ReadS DfaNode # readList :: ReadS [DfaNode] # readPrec :: ReadPrec DfaNode # readListPrec :: ReadPrec [DfaNode] #
Show DfaNode Source #
Methods showsPrec :: Int -> DfaNode -> ShowS # show :: DfaNode -> String # showList :: [DfaNode] -> ShowS #
Binary DfaNode Source #
Methods put :: DfaNode -> Put # get :: Get DfaNode # putList :: [DfaNode] -> Put #
Binary DfaGraph Source #
Methods put :: DfaGraph -> Put # get :: Get DfaGraph # putList :: [DfaGraph] -> Put #

newtype DfaSymbol Source #

DFA symbol type

Constructors

DfaValue Char

Instances

Eq DfaSymbol Source #
Methods (==) :: DfaSymbol -> DfaSymbol -> Bool # (/=) :: DfaSymbol -> DfaSymbol -> Bool #
Ord DfaSymbol Source #
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 Source #
Methods readsPrec :: Int -> ReadS DfaSymbol # readList :: ReadS [DfaSymbol] # readPrec :: ReadPrec DfaSymbol # readListPrec :: ReadPrec [DfaSymbol] #
Show DfaSymbol Source #
Methods showsPrec :: Int -> DfaSymbol -> ShowS # show :: DfaSymbol -> String # showList :: [DfaSymbol] -> ShowS #
Binary DfaSymbol Source #
Methods put :: DfaSymbol -> Put # get :: Get DfaSymbol # putList :: [DfaSymbol] -> Put #
Binary DfaGraph Source #
Methods put :: DfaGraph -> Put # get :: Get DfaGraph # putList :: [DfaGraph] -> Put #

class DfaBuilder from where Source #

DFA builders

Minimal complete definition

buildDfa

Methods

buildDfa :: from -> DfaGraph Source #

Orphan instances

Binary item => Binary (LrCollection item) Source #
Methods put :: LrCollection item -> Put # get :: Get (LrCollection item) # putList :: [LrCollection item] -> Put #