-
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
-
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
-
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
-
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
-
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
