parse

Jun 5, 2023

Changes in this version

+ func EncodeBytes(p Parser) []byte

+ func WriteFile(p Parser, filename string) error

type Algorithm

+ const CLR1

+ const LALR1

+ const LL1

+ const SLR1

type Parser

+ func DecodeBytes(data []byte) (p Parser, err error)

+ func ReadFile(filename string) (Parser, error)

+ type Tree struct

+ Children []*Tree

+ Source lex.Token

+ Terminal bool

+ Value string

+ func Leaf(term string, t ...lex.Token) *Tree

+ func Node(nt string, children ...*Tree) *Tree

+ func (pt Tree) Copy() Tree

+ func (pt Tree) Equal(o any) bool

+ func (pt Tree) Follow(path []int) *Tree

+ func (pt Tree) IsSubTreeOf(t Tree) (contains bool, path []int)

+ func (pt Tree) PathToDiff(t Tree, ignoreShortCircuit bool) (path []int, diverges bool)

+ func (pt Tree) String() string

May 13, 2023

Changes in this version

+ const ShortCircuitPrefix

+ func GenerateCLR1Parser(g grammar.Grammar, allowAmbig bool) (*lrParser, []string, error)

+ func GenerateSLR1Parser(g grammar.Grammar, allowAmbig bool) (*lrParser, []string, error)

+ func IsLL1(g grammar.Grammar) bool

+ type Algorithm string

+ const AlgoCLR1

+ const AlgoLALR1

+ const AlgoLL1

+ const AlgoSLR1

+ func ParseAlgorithm(s string) (Algorithm, error)

+ func (pt Algorithm) String() string

+ type ParseTree struct

+ Children []*ParseTree

+ Source lex.Token

+ Terminal bool

+ Value string

+ func DeriveFullTree(g grammar.Grammar, fakeValProducer ...map[string]func() string) ([]ParseTree, error)

+ func MustParseTreeFromDiagram(s string) *ParseTree

+ func PTLeaf(term string, t ...lex.Token) *ParseTree

+ func PTNode(nt string, children ...*ParseTree) *ParseTree

+ func ParseTreeFromDiagram(s string) (*ParseTree, error)

+ func (pt ParseTree) Copy() ParseTree

+ func (pt ParseTree) Equal(o any) bool

+ func (pt ParseTree) Follow(path []int) *ParseTree

+ func (pt ParseTree) IsSubTreeOf(t ParseTree) (contains bool, path []int)

+ func (pt ParseTree) PathToDiff(t ParseTree, ignoreShortCircuit bool) (path []int, diverges bool)

+ func (pt ParseTree) String() string

+ type Parser interface

+ DFAString func() string

+ Grammar func() grammar.Grammar

+ Parse func(stream lex.TokenStream) (ParseTree, error)

+ RegisterTraceListener func(func(s string))

+ TableString func() string

+ Type func() Algorithm

Mar 24, 2023

Changes in this version

+ func EmptyCLR1Parser() *lrParser

+ func EmptyLALR1Parser() *lrParser

+ func EmptyLL1Parser() *ll1Parser

+ func EmptySLR1Parser() *lrParser

Mar 4, 2023

Changes in this version

+ func GenerateCanonicalLR1Parser(g grammar.Grammar, allowAmbig bool) (*lrParser, []string, error)

+ func GenerateLALR1Parser(g grammar.Grammar, allowAmbig bool) (*lrParser, []string, error)

+ func GenerateLL1Parser(g grammar.Grammar) (*ll1Parser, error)

+ func GenerateSimpleLRParser(g grammar.Grammar, allowAmbig bool) (*lrParser, []string, error)

+ type LRAction struct

+ Production grammar.Production

+ State string

+ Symbol string

+ Type LRActionType

+ func (act LRAction) Equal(o any) bool

+ func (act LRAction) String() string

+ type LRActionType int

+ const LRAccept

+ const LRError

+ const LRReduce

+ const LRShift

+ func (lt LRActionType) String() string

+ type LRParseTable interface

+ Action func(state, symbol string) LRAction

+ GetDFA func() string

+ Goto func(state, symbol string) (string, error)

+ Initial func() string

+ String func() string