On Jun 11, 2007, at 9:26 AM, Robert Grimm wrote:
Furthermore, once you combine both lexical and hierarchical syntax,
i.e., rely on scannerless parsing, you can do strictly more. Martin
Hirzel and I have combined the complete Java and C languages into a
new language (called Jeannie) to substantially simplify Jave Native
Interface programming. The syntactic composition of the existing
grammars for Java and C was trivial thanks in part to scannerless
parsing. Several papers by Eelco Visser make a similar case for
other language extensions, only they are building on a scannerless
GLR parser generator.
Impressive!
In principle, you could use ANTLR's lexer as a parser for a big
language. Would work same way. It would use LL(*) as optimization
unless it had to backtrack. Should have speed and composability per
the groovy Rats! creature! :)
ANTLR v3 lexers are way faster than v2 so I'm hoping you'd get good
performance from this. Anyway, it's an option. You just have to
make all rules but the start rule a "fragment". Or I could make a
new "mode" for lexers that made them think they are parsers.
Ter
_______________________________________________
PEG mailing list
PEG@lists.csail.mit.edu
https://lists.csail.mit.edu/mailman/listinfo/peg
