1
vote
Accepted
Remove left recursion from a grammar without necessarily removing epsilon production
If a grammar includes nullable productions, then it may have hidden left recursion; a production such as $A\to N A \beta$ where $N$ is nullable. Such a production won't be removed by Ullman's ...
1
vote
What are the maximum possible values of X and Y?
Let's try to find a feasible allocation of passengers to buses that minimizes $X$. Let's consider the ideal situation in which all non-empty buses, except possibly one, are filled with one less than $...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
gate-cs × 8compilers × 3
formal-grammars × 2
formal-languages × 1
context-free × 1
computer-architecture × 1
pushdown-automata × 1
cpu × 1
ambiguity × 1
cpu-pipelines × 1
books × 1
routing × 1
left-recursion × 1
mips × 1
ll-k × 1