Project PerCederberg.Grammatica.Runtime

Class Summary
Analyzer	A parse tree analyzer.
DFAState	An automaton state.
GrammaticaRE	The Grammatica built-in regular expression handler.
LookAheadSet	A token look-ahead set.
NFACharRangeTransition	A character range match transition.
NFACharTransition	A single character match transition.
NFADigitTransition	The digit character set transition.
NFADotTransition	The dot ('.') character set transition.
NFAEpsilonTransition	The special epsilon transition.
NFAMatcher	A token pattern matcher using a NFA for both string and regular expression tokens.
NFANonDigitTransition	The non-digit character set transition.
NFANonWhitespaceTransition	The non-whitespace character set transition.
NFANonWordTransition	The non-word character set transition.
NFAState	An NFA state.
NFAStateQueue	An NFA state queue.
NFATransition	An NFA state transition.
NFAWhitespaceTransition	The whitespace character set transition.
NFAWordTransition	The word character set transition.
Node	An abstract parse tree node.
ParseException	A parse exception.
Parser	A base parser class.
ParserCreationException	A parser creation exception.
ParserLogException	A parser log exception.
Production	A production node.
ProductionPattern	A production pattern.
ProductionPatternAlternative	A production pattern alternative.
ProductionPatternElement	A production pattern element.
ReaderBuffer	A character buffer that automatically reads from an input source stream when needed.
RecursiveDescentParser	A recursive descent parser.
RegExpMatcher	A token pattern matcher for complex regular expressions.
REHandler	The regular expression handler base class.
StringDFAMatcher	A token pattern matcher using a DFA for string tokens.
SystemRE	The .
Token	A token node.
Tokenizer	A character stream tokenizer.
TokenMatch	The token match status.
TokenMatcher	A token pattern matcher.
TokenNFA	A non-deterministic finite state automaton (NFA) for matching tokens.
TokenPattern	A token pattern.
TokenRegExpParser	A regular expression parser.
TokenStringDFA	A deterministic finite state automaton for matching exact strings.
TransitionTree	An automaton state transition tree.