LR parsers are attractive because
A. it does not back track
B. it can be constructed to recognize CFG corresponding to almost all programming constructs
C. both (a) and (b)
D. none of these
Answer:B
LR parsers are attractive because
A. it does not back track B. it can be constructed to recognize CFG corresponding to almost all programming constructs C. both (a) and (b) D. none of these