Hi,
From sequence I guess it's PL/SQL. If it is, then a PL/SQL grammar is a
good starting point: http://antlr.org/grammar/1209225566284/PLSQL3.g
Although I haven't tried this yet.
Zoli
Hi,
Could anybody help me with writing a grammar that does the following:
Parsing values that are
Helo,
I'm trying to create a Tree Grammar to walk my ASTs, and I encountered a
problem:
I have these tree grammar rules (which are relevant, I guess):
query_specification
: ^(selectClause (^(INTO intoClause))? (^(FROM fromClause))? (^(WHERE
whereClause))? (^(GROUP groupbyClause))?
Helo!
I want to create a Tree Grammar from my normal grammar (with the method
described in the ANTLR book), and after I corrected some obvious errors
(remove AST operators, etc.) I got this one:
Exception in thread Thread-5 java.lang.StackOverflowError
at
thanks, now I got different errors (warnings I guess):
error(10): internal error:
org.antlr.tool.Grammar.createLookaheadDFA(Grammar.java:1242): could not
even do k=1 for decision 8; reason: timed out (1000ms)
error(10): internal error: