python (65.2k questions)
javascript (44.3k questions)
reactjs (22.7k questions)
java (20.8k questions)
c# (17.4k questions)
html (16.3k questions)
r (13.7k questions)
android (13k questions)
Should a merge failure stop the LR(1) to LALR(1) conversion
Let's say I have got a set of LR(1) states and I want to try to convert it to LALR(1).
I did the first step of finding states that have got the same LR(0) core and now I'm doing the merge process. How...

Felix.leg
Votes: 0
Answers: 1
LR(1) item sets for left recursive grammar
I read several papers about creating LR(1) item sets, but none of them pertained to left recursive grammars, such as those used for parsing expressions. If I had the following grammar,
E -> E + T |...
ishaangupte
Votes: 0
Answers: 1
Epsilon(ε) productions and LR(0) grammars and LL(1) grammars
At many places (for example in this answer here), I have seen it is written that an LR(0) grammar cannot contain ε productions.
Also in Wikipedia I have seen statements like: An ε free LL(1) grammar i...
Abhishek Ghosh
Votes: 0
Answers: 1
Preferring shift over reduce in parser for language without statement terminators
I'm parsing a language that doesn't have statement terminators like ;. Expressions are defined as the longest sequence of tokens, so 5-5 has to be parsed as a subtraction, not as two statements (liter...

Moritz Mahringer
Votes: 0
Answers: 1