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)
How to remove ambiguity of this grammar using lark
I have build a grammar for propositional formulas, however I have found that it is ambiguous, i.e., there is more than one derivation tree for my input formulas.
This is the smallest ambiguous grammar...
djimenez
Votes: 0
Answers: 0
How to generate all possible parsings of an ambiguous grammar
I've looked at quite a few grammar parsers, but none of them seem to be able to generate all parsings of an ambiguous grammar. (I've also checked these questions, which don't provide any helpful solut...
Pro Q
Votes: 0
Answers: 3
Bison reduce/reduce conflict between lambda expression and parenthesized identifier
I'm attempting to write my own programming language at the moment, and I have the following simplified grammar:
...
%%
prog: stmtlist | %empty;
block: "{" stmtlist "}";
stmtlis...
jinscoe123
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