3 commits

Author	SHA1	Message	Date
Jan Lindemann	a3a8313ce8	grammar.py and friends: Make list parsing run through ... First time parsing doesn't error out with a syntax error. No usable AST is produced, strings are not returned from lexer, and AST lists aren't lists, really. TEXT:="Hello world!"; had to be excluded from the example, because I don't get how this could be parsed with the given syntax. There's a special sequence "all visible characters", but any lexer regex I could think of will also match the types defining "alphabetic character" and return the respective tokens (e.g. T_A) or vice-versa, depending on the order in the lexer input file. I suppose, the only sensible way to handle this, is to define "all visible characters" by defining the tokens for the missing characters, and then use them along T_A ... T_Z or their derived types. Signed-off-by: Jan Lindemann <jan@janware.com>	2017-11-02 13:47:19 +01:00
Jan Lindemann	432d78cdc5	grammar.py: Add grammar_parse_ebnf_tokens() ... Add grammar_parse_ebnf_tokens(), to be used by external grammar parsers and grammar_parse_ebnf() Signed-off-by: Jan Lindemann <jan@janware.com>	2017-10-28 19:16:00 +02:00
Jan Lindemann	40e6add5ad	Continue implementation of grammar.py ... Signed-off-by: Jan Lindemann <jan@janware.com>	2017-10-25 13:45:44 +02:00