Concept drill
LR(1)
GATE CSE & IT · Parsing · 2007-2015
4
PYQs
100%
keyed
0
elite explanations
4
years appeared
Study anchor
Hopcroft-Ullman / Dragon Book
Automata, languages, parsing, syntax-directed translation
Practice action
Start latest PYQPYQs in this concept
All concepts →2015 PYQ
Consider the following grammar $$G$$ $$\eqalign{ & \,\,\,\,\,\,\,S \to \,\,\,\,\,\,\,F|H \cr & \,\,\,\,\,\,F \to \,\,\,\,\,\,\,p|c \cr & \,\,\,\,\,\,H \to \,\,\,\,\,\,\,d|c \cr} $$...
easyanswer key
2010 PYQ
The grammar $$S \to aSa\,|\,\,bS\,|\,\,c$$ is
easyanswer key
2008 PYQ
An LALR(1) parser for a grammar G can have shift-reduce (S-R) conflicts if and only if
mediumanswer key
2007 PYQ
Consider the following two statements: P: Every regular grammar is LL(1) Q: Every regular set has a LR(1) grammar Which of the following is TRUE?
mediumanswer key