For an SLR(1) parser, when does the parser perform a REDUCE action A -> alpha in state I under lookahead symbol 'a'?
SLR(1) uses FOLLOW sets to restrict reduce actions: reduce by A -> alpha in state I only if lookahead token 'a' belongs to FOLLOW(A).
What is the relationship between the number of states in SLR(1), LALR(1), and CLR(1) parsers for a given grammar?
LR(0), SLR(1), and LALR(1) all share identical state counts (based on merged LR(0) cores), whereas CLR(1) keeps unmerged states and has significantly more states.
Which of the following parser types uses YACC / BISON parser generators?
YACC (Yet Another Compiler-Compiler) and BISON generate efficient LALR(1) bottom-up parsers.
In an Operator Precedence parser, what relation is defined between adjacent terminal symbols a and b?
Operator precedence parsing uses three disjoint precedence relations (<., =., .>) between terminals to steer shift-reduce actions without full non-terminal matching.
What is a Viable Prefix in LR parsing?
A viable prefix is a prefix of a right sentential form that does not extend past the right end of the handle, representing a valid stack state in LR parsing.