[antlr-interest] pushed antlr build with tree rewriting and composite grammars (java)

[David Holroyd]

On Sat, Jan 12, 2008 at 05:25:51PM -0800, Terence Parr wrote:
> Oh, not lexer fragments...parser fragments...hmm..should work. can u  
> trace for me a bit further?

Turning on DFA.debug gives the following trace for the decision which is
failing,

  Enter DFA.predict for decision 47
  DFA 47 state 0 LA(1)=\uffff(-1), index=1
  min[0]=5
  max[0]=d
  eot[0]=-1
  eof[0]=-1
  1 -1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 9 

also, DFA47.eof == [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1], if that's
relevant.


Is there any more info I could provide?


ta,
dave

-- 
http://david.holroyd.me.uk/