|
Absimpa v196 | ||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||
GrammarBuilder to create a grammar by
providing a string syntax resembling Backus Naur
Form (BNF) to build recursive grammars.c of the
enumeration as tokens of the grammar with new
TokenGrammar<N,C>(c).
g.
N from the child objects.
Grammar describes a language made of sequences of C
objects provided by a Lexer.Grammar for a language made from objects of type
C.GrammarBuilder will enter the given factory into
grammar objects as they are created, if no factory is explicitly
provided.
text.
Grammar.compile().Parser.SimpleLexer.SimpleLexer(Class, example.LeafFactory) to
automatically set up the lexical analysis for all tokens of the enum.Grammar.compile().N from a list of N objects provided by a
parser.this into a Repeat with min=0 and {code
max=1}.
this into a Repeat with min=0 and {code
max=1}.
GrammarBuilder.repeat(Grammar,int,int) with
min=0 and max=1.
GrammarBuilder.repeat(NodeFactory,Grammar,int,int) with min=0 and
max=1.
<C> from the given Lexer and transforms it into an object of type <N>.
ParseException on request from the parser.
ParseException, but it does
not create it itself.this into a Repeat.
g.
GrammarBuilder.repeat(NodeFactory, Grammar,int,int),
but with the default NodeFactory.
rule(), but without any node factory.
name into a grammar described
by expansion, using the given node factory.
g.
GrammarBuilder.seq(NodeFactory, Grammar), but with the
default NodeFactory.
Grammar.toString() only, not needed for the function of the
grammar.
Lexer which analyzes a
string by trying out regular expressions for tokens until a match is
found.TrivialLexer to return eofCode
when the end of input is encountered.
tokenCode with SimpleLexer.addToken(C, java.lang.String)
except if it is identical to the LexerInfo.eofCode() it provides.
this into a Repeat with min=0 and {code
max} really huge.
this into a Repeat with min=0 and {code
max} really huge.
GrammarBuilder.repeat(Grammar,int,int) with
min=0 and max=Integer.MAX_VALUE.
GrammarBuilder.repeat(NodeFactory,Grammar,int,int) with min=0 and
max=Integer.MAX_VALUE.
C.
|
Absimpa v196 | ||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||