[antlr-interest] v4 "Honey Badger" teaser
Terence Parr
parrt at cs.usfca.edu
Thu Dec 29 16:08:39 PST 2011
Hi Kyle, I've also implemented the shorthand [] for lexers. :) woot!
// "The keywords node, edge, graph, digraph, subgraph, and strict are
// case-independent"
STRICT : [Ss][Tt][Rr][Ii][Cc][Tt] ;
GRAPH : [Gg][Rr][Aa][Pp][Hh] ;
DIGRAPH : [Dd][Ii][Gg][Rr][Aa][Pp][Hh] ;
NODE : [Nn][Oo][Dd][Ee] ;
EDGE : [Ee][Dd][Gg][Ee] ;
SUBGRAPH : [Ss][Uu][Bb][Gg][Rr][Aa][Pp][Hh] ;
Ter
On Dec 29, 2011, at 3:58 PM, Kyle Ferrio wrote:
> Excellent. I always thought that it should be possible to support
> left-recursion with LL(*) but I did not presume that it would be efficient
> or easy or wise. Since I tend to think left-recursively a lot, I am a
> happy honey badger, and I parse whatever I want!
>
> Kyle
More information about the antlr-interest
mailing list