GATE 2013 · session-1
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon- and unit-production (i.e., of type
Aε and
Aa) to parse a string with n tokens?
Related Compiler Design PYQs
Which of the following grammar classes is the MOST powerful parser in terms of language recognition capability?
Consider these two sets of LR(1) items of an LR(1) grammar: | Set 1 | Set 2 | |---|---| | X → c·X, c/d | X → c·X, $ | | X → ·cX, …
The following code is executed on a processor allowing only register operands. Each instruction can have at most two source operan…
The following code is executed on a processor allowing only register operands. Each instruction can have at most two source operan…
Consider the following C statements: char *str1 = "Hello; /* Statement S1 */ char *str2 = "Hello;"; /* Statement S2 …
Which of the following statements is/are true?
Free account benefits
Turn practice into measurable progress
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.
Saved progressKeep answers, mock results and completion history across devices.
Adaptive practiceGet questions matched to your recent accuracy and difficulty level.
Bookmarks and notesBuild a personal revision list and record why a question was difficult.
Performance insightsSee weak subjects, accuracy trends, streaks and exam readiness.