Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Data Structures | Typedefs | Enumerations | Variables
grammar::parsing Namespace Reference

Data Structures

class  AbsorbTerminalSymbol
 
class  CornerSubstitution
 
class  DeterministicLL1Grammar
 
class  DeterministicLL1ParseTable
 
class  ExtractRightContext
 
class  First
 
class  Follow
 
class  HandleFirstFirstConflict
 
class  HandleFirstFollowConflict
 
class  LeftFactorize
 
class  LL1ParseTable
 
class  LR0Parser
 
class  LRParser
 
class  SLR1ParseTable
 
class  Substitute
 

Typedefs

typedef ext::map< DefaultSymbolType, ext::set< ext::pair< unsigned, ext::vector< ext::variant< DefaultSymbolType, DefaultSymbolType > > > > > LR0Items
 
typedef ext::map< ext::pair< LR0Items, DefaultSymbolType >, ext::pair< LRAction, ext::variant< LR0Items, ext::pair< DefaultSymbolType, ext::vector< ext::variant< DefaultSymbolType, DefaultSymbolType > > > > > > LRActionTable
 
typedef ext::map< ext::pair< LR0Items, DefaultSymbolType >, LR0ItemsLRGotoTable
 

Enumerations

enum class  LRAction { Shift , Reduce , Accept }
 

Variables

auto DeterministicLL1GrammarCFG = registration::AbstractRegister < DeterministicLL1Grammar, grammar::CFG < >, const grammar::CFG < > & > ( DeterministicLL1Grammar::convert )
 

Typedef Documentation

◆ LR0Items

◆ LRActionTable

◆ LRGotoTable

Enumeration Type Documentation

◆ LRAction

enum class grammar::parsing::LRAction
strong
Enumerator
Shift 
Reduce 
Accept 

Variable Documentation

◆ DeterministicLL1GrammarCFG

auto grammar::parsing::DeterministicLL1GrammarCFG = registration::AbstractRegister < DeterministicLL1Grammar, grammar::CFG < >, const grammar::CFG < > & > ( DeterministicLL1Grammar::convert )