ANTLR grammar from bison

Posted by Iulian Serbanoiu on Stack Overflow See other posts from Stack Overflow or by Iulian Serbanoiu
Published on 2010-03-31T13:21:52Z Indexed on 2010/03/31 13:43 UTC
Read the original article Hit count: 609

Filed under:

antlr

|

bison

|

grammar

Hello,

I'm trying to translate a grammar from bison to ANTLR. The grammar itself is pretty simple in bison but I cannot find a simple way for doing this.

Grammar in bison:

expr = expr or expr | expr and expr | (expr)

Any hints/links/pointers are welcome.

Thanks, Iulian

© Stack Overflow or respective owner

Related posts about antlr

Antlr question: cannot get Antlr tool to compile simple file from ANTLRWorks

as seen on Stack Overflow - Search for 'Stack Overflow'
Here is the grammar file: grammar fred; test : 'fred'; Here is the batch file to launch the tool: SET JAVA_HOME=C:\Program Files\Java\jdk1.6.0_24 SET PATH=%PATH%;%JAVA_HOME%\bin SET ANTLR_HOME=c:/users/don/workspace/antlrAssign/lib/ java -cp %ANTLR_HOME%/antlr-3.3-complete.jar antlr.Tool… >>> More
Improving ANTLR DSL parse-error messages

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm working on a domain-specific language (DSL) for non-programmers. Non-programmers make a lot of grammar mistakes: they misspell keywords, they don't close parentheses, they don't terminate blocks, etc. I'm using ANTLR to generate my parser; it provides a nifty mechanism for handling RecognitionExceptions… >>> More
ANTLR - accessing token values in c/c++

as seen on Stack Overflow - Search for 'Stack Overflow'
Hello, I am trying to parse integers and to access their value in antlr 3.2. I already found out how to do this in Java: //token definition INT : '0'..'9'+; //rule to access token value: start : val=INT {Integer x = Integer.valueOf( $val.text ).intValue(); } ; ... but I couldn't… >>> More
Removing Left Recursion in ANTLR

as seen on Stack Overflow - Search for 'Stack Overflow'
As is explained in http://stackoverflow.com/questions/2652060/removing-left-recursion , there are two ways to remove the left recursion. Modify the original grammar to remove the left recursion using some procedure Write the grammar originally not to have the left recursion What people normally… >>> More
Jar not found when executing class

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi there, I'm working through the ANTLR book and there are many examples that should be easy to compile using the command line. Some information to get te problem: antlr-3.2.jar contains the ANTLR classes. I added the antlr-3.2.jar to the CLASSPATH environment variable (Windows 7) and when compiling… >>> More

Related posts about bison

ANTLR grammar from bison

as seen on Stack Overflow - Search for 'Stack Overflow'
Hello, I'm trying to translate a grammar from bison to ANTLR. The grammar itself is pretty simple in bison but I cannot find a simple way for doing this. Grammar in bison: expr = expr or expr | expr and expr | (expr) Any hints/links/pointers are welcome. Thanks, Iulian >>> More
How do i implement If statement in Flex/bison

as seen on Stack Overflow - Search for 'Stack Overflow'
Hallo, I need help in flex/bison. Im a beginner in flex/bison, and i hav already looked out these programs and somethings i inderstood, but im learning. My problem is, i want to implement a If-statement via Flex/Bison and i dont know how to start how to do, someone any idea, im very thankful for all… >>> More
Filter y.output from bison or yacc?

as seen on Stack Overflow - Search for 'Stack Overflow'
I am using bison and its difficult to figure out the conflicts by looking at y.output. Is there a tool to make or filter y.output so its more useful? i would love to see the full path to the state with the conflict but anything helpful is what i would like. >>> More
rules precedence in bison

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi Here is the grammar rules: ProcessExpression : EventExpression "->" ProcessExpression | ProcessName ; Please can you tell me how can I tell to bison that the first rule has the highest precedence than the second one? I have tried: %nonassoc PROC %right "->" ProcessExpression… >>> More
how to instruct bison that I'm expecting TWO or more terminals

as seen on Stack Overflow - Search for 'Stack Overflow'
How can I define a rule in BISON that will state that I need two or more terminals. I use it like this and I get a shift/reduce conflict: word: LETTER | word LETTER; words: word word | words word; What's wrong here? And how to correct it? >>> More