Register

#CompilerDesign

• retagged by
375 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · TCp congestion contr...Next → · what is the output o...
← Previous in category · SCOA021 TEST 1 2024Next in category → · igate booklet questi...
Position:
Show:

Related questions

0 0 votes
1 answers 1 answer
257
257 views
souled asked Mar 22
257 views
LL1 parsing table
ISNT THIS LL1 PARSING TABLE WRONG??SINCE first of S is {a,b} S- AB should be written is column a and b both..
3 3 votes
2 2 answers
1.6k
1.6k views
gatecse asked Feb 23
1,584 views
GATE CSE 2026 | Set 1 | Question: 18
Which of the following statements is/are true?$\text{LL(1)}$ parser uses backtrackingFor a grammar to be $\text{LL(1)}$, it must be left-recursiveFor a grammar to be $\te...
19 19 votes
2 2 answers
11.2k
11.2k views
Arjun asked Feb 16, 2024
11,223 views
GATE CSE 2024 | Set 2 | Question: 30
Consider the following context-free grammar where the start symbol is $\text{S}$ and the set of terminals is $\{a, b, c, d\}$.$$\begin{array}{l}S \rightarrow A a A b \mid...
7 7 votes
0 0 answers
2.1k
2.1k views
GO Classes asked Feb 5, 2024
2,092 views
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 53
The grammar shown below is LL(k) for some value of k. What is the smallest value of k for which this grammar is LL(k)?