Register

Recent questions tagged parsing

1 1 vote
0 0 answers
157
157 views
Neso Academy Lectures | Compiler Design | LR Parsing
We know that the class of languages of LR(0), SLR(1), LALR(1), CLR(1) is the class of DCFLs, with the only exception being that...An LR(0) language is a DCFL that has the...
User Avatar
0 0 votes
1 1 answer
91
91 views
UGC NET CSE | December 2025 | Part 2 | Question: 71
What is the space complexity of the CYK algorithm for the $\mathrm{P}$ table, where $\mathrm{n}$ is the number of words in the sentence and $\mathrm{m}$ is the number of ...
User Avatar
0 0 votes
1 answers 1 answer
234
234 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..
User Avatar
3 3 votes
2 2 answers
1.5k
1.5k 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...
User Avatar
1 1 vote
0 0 answers
235
235 views
Parse Tree - Self Doubt
Self DoubtSuppose there are about n tokens in a input string , each of the token is matched with some production rule, how many total production rules used in the parse t...
User Avatar
0 0 votes
2 2 answers
385
385 views
Theory of compiler Ullman (Compiler Design) Edition 2 Thory of computation
Please please please help me Answer thisQ1. Given RE to DFA: (0+1)*10*10*Q2. Write the regular expression for: “All strings of {a,b}containing atleast two b’s.” 
User Avatar
1 1 vote
1 1 answer
403
403 views
Theory of compiler Ullman (Compiler Design) Edition 2 Thory of computation
Q5b) Given RE to DFA: (b/a)*baa(Show Answer with Drawing and steps)  
User Avatar
0 0 votes
0 0 answers
259
259 views
Theory of compiler - Theory of Computation - Theory of compiler Ullman (Compiler Design) Edition 2
Hi my dear Please help me to Answer This Questions  Q1. Answer the following a) Check the ambiguity for the string “aaa” in the given grammar:S → aB | bAA → aS | bAA | aB...
User Avatar
0 0 votes
1 1 answer
1.0k
1.0k views
UGC NET CSE | June 2025 | Part 2 | Question: 51
Arrange the following parsers in increasing order of their power of handling grammars i.e. from the least powerful parser to the most powerful parser.$\mathrm{LR}(0)$$\ma...
User Avatar
0 0 votes
0 0 answers
224
224 views
UGC NET CSE | January 2025 | Part 2 | Question: 67
$\mathrm{y}_{\mathrm{acc}}$ is which of the following parsers?Predictive Parser$\text{SLR}$ Parser$\text{CLR}$ Parser$\text{LALR}$ Parser
User Avatar
0 0 votes
1 1 answer
327
327 views
UGC NET CSE | August 2024 | Part 2 | Question: 1
Consider the Grammar:\[\begin{array}{l} \mathrm{S} \rightarrow \mathrm{~A} \\ \mathrm{~A} \rightarrow \$ \mathrm{~B} \$ \mid \mathrm{id} \\ \mathrm{~B} \rightarrow \mathr...
User Avatar
0 0 votes
2 2 answers
425
425 views
UGC NET CSE | August 2024 | Part 2 | Question: 51
Arrange the following stages of parsing in the correct order as they typically occur in the compilation process.Lexical AnalysisSematic AnalysisSyntax AnalysisIntermediat...
User Avatar
2 2 votes
0 0 answers
197
197 views
UGC NET CSE | December 2023 | Part 2 | Question: 24
Consider a Grammar $\mathrm{E} \rightarrow \mathrm{E}+\mathrm{n}\mid \mathrm{E} \times \mathrm{n} \mid \mathrm{n}$ for a sentence $\mathrm{n}+\mathrm{n} \times \mathrm{n}...
User Avatar
0 0 votes
0 0 answers
170
170 views
UGC NET CSE | December 2023 | Part 2 | Question: 64
Which of the following are commonly used parsing techniques in $\textrm{NLP}$ (Natural Language Processing) for syntatic analysis.Top down parsingBottom Up parsingDepende...
User Avatar
1 1 vote
1 1 answer
189
189 views
NIELIT Scientific Assistant June 2025 | Question: 95
Which of the following is $\text{NOT}$ a component of syntax analysis in a compiler?Syntax treeParse treeTokenGrammar rules
User Avatar
Page: