An 'Operator Grammar' in compiler design is a Context-Free Grammar with which restriction?
An Operator Grammar forbids \epsilon productions and adjacent non-terminals (e.g., A -> B C is illegal), enabling simple operator-precedence parsing.
In an Operator Precedence parser, which precedence relations can exist between two terminal symbols a and b?
Operator precedence parsers define three relations between terminals: yield precedence (<.), take precedence (.>), and equal precedence (=.).
In bottom-up parsing, what is a 'Handle'?
A handle is a production A -> \beta and a position in a right-sentential form \gamma where \beta appears and can be reduced to A.
The systematic process of discovering a handle in a sentential form and replacing it with its corresponding non-terminal head is called:
Handle Pruning is the bottom-up process of repeatedly identifying handles and reducing them to construct a reverse rightmost derivation.
How do SLR(1) and LALR(1) parser tables compare with respect to the total number of states generated for a grammar G?
SLR(1) is built from LR(0) item sets. LALR(1) merges LR(1) item sets that share identical LR(0) cores, resulting in the exact same number of states as LR(0)/SLR(1).