I am sure this is an age old question and I did find some initial results on
Google.
I am looking for a program, preferably open source, that can generate all of
the text combinations for a given BNF. Obviously the program should allow
constraints to be set that limit such tings as number of
Hi David,
Every root (or leaf) in the AST must be an instance of a `
org.antlr.runtime.tree.Tree`, so you can't create a node that is a
`java.util.List`.
By default, ANTLR creates its AST using `org.antlr.runtime.tree.CommonTree`
objects which inherits the `getChildren()` method from
Your lexer does not cater for spaces.
Jim
-Original Message-
From: antlr-interest-boun...@antlr.org [mailto:antlr-interest-
boun...@antlr.org] On Behalf Of Simon Marchi
Sent: Friday, May 20, 2011 3:33 PM
To: antlr-interest@antlr.org
Subject: [antlr-interest] gUnit: Test of a parser