In the standard notation LR(k), what do 'L', 'R', and 'k' represent respectively?
'L' stands for Left-to-right scanning of input, 'R' stands for constructing a Rightmost derivation in reverse, and 'k' indicates the number of lookahead input symbols used.
In the standard notation LL(1), what do the two 'L's and '1' represent?
First 'L' = Left-to-right scanning, second 'L' = Leftmost derivation, and '1' = 1 token lookahead to choose production rules.
Elimination of Left Recursion from a grammar is an essential mandatory prerequisite for which class of parsers?
$Left recursion (e.g., A -> A \alpha) causes top-down predictive parsers to enter infinite recursive loops. Therefore, left recursion must be eliminated before building LL(1) or recursive descent parsers.$
What is the primary objective of applying 'Left Factoring' to a grammar in compiler design?
Left factoring transforms rules like A -> \alpha beta1 | \alpha beta2 into A -> \alpha A' and A' -> beta1 | beta2 so that lookahead can deterministically select the correct path.
In a Shift-Reduce parser, what action takes place during a 'Shift' operation?
During a Shift action, the next input symbol is moved from the input stream onto the parsing stack.