Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Slides
Recent questions tagged parsing
1
vote
1
answer
91
NIELIT Scientific Assistant A 2020 November: 94
Shift reduce parsing can also be called as: Reverse of the Right Most Derivation Right Most Derivation Left Most Derivation None of the options
gatecse
asked
in
Compiler Design
Dec 9, 2020
by
gatecse
412
views
nielit-sta-2020
compiler-design
parsing
lr-parser
1
vote
4
answers
92
NIELIT Scientific Assistant A 2020 November: 118
The $\text{LL(1)}$ and $\text{LR(0)}$ techniques are ___________ Both same in power Both simulate reverse of right most derivation Both simulate reverse of left most derivation Incomparable
gatecse
asked
in
Compiler Design
Dec 9, 2020
by
gatecse
1.1k
views
nielit-sta-2020
compiler-design
parsing
1
vote
1
answer
93
NIELIT 2016 MAR Scientist C - Section C: 11
The most powerful parser is $\text{SLR}$ $\text{LALR}$ Canonical $\text{LR}$ Operator-precedence
admin
asked
in
Compiler Design
Apr 2, 2020
by
admin
1.7k
views
nielit2016mar-scientistc
compiler-design
parsing
1
vote
1
answer
94
NIELIT 2016 MAR Scientist C - Section C: 12
$\text{YACC}$ builds up $\text{SLR}$ parsing table Canonical $\text{LR}$ parsing table $\text{LALR}$ parsing table None of these
admin
asked
in
Compiler Design
Apr 2, 2020
by
admin
1.3k
views
nielit2016mar-scientistc
compiler-design
parsing
0
votes
6
answers
95
NIELIT 2016 MAR Scientist C - Section C: 13
Context-free grammar can be recognized by finite state automation $2$- way linear bounded automata push down automata both (B) and (C)
admin
asked
in
Compiler Design
Apr 2, 2020
by
admin
6.0k
views
nielit2016mar-scientistc
compiler-design
parsing
1
vote
4
answers
96
NIELIT 2016 DEC Scientist B (CS) - Section B: 40
A top down parser generates Left most derivation Right most derivation Left most derivation in reverse Right most derivation in reverse
admin
asked
in
Compiler Design
Mar 31, 2020
by
admin
1.1k
views
nielit2016dec-scientistb-cs
compiler-design
parsing
0
votes
1
answer
97
UGC NET CSE | December 2005 | Part 2 | Question: 32
A Top - down Parse generates Left most derivation Right – most derivation Right most derivation in reverse Left – most derivation in reverse
go_editor
asked
in
Compiler Design
Mar 27, 2020
by
go_editor
392
views
ugcnetcse-dec2005-paper2
compiler-design
parsing
1
vote
3
answers
98
ISRO2020-75
A grammar is defined as $A \rightarrow BC$ $B \rightarrow x \mid Bx$ $C \rightarrow B \mid D$ $D \rightarrow y \mid Ey$ $E \rightarrow z$ The non terminal alphabet of the grammar is $\{A,B,C,D,E\}$ $\{B,C,D,E\}$ $\{A,B,C,D,E,x,y,z\}$ $\{x,y,z\}$
Satbir
asked
in
Compiler Design
Jan 13, 2020
by
Satbir
2.3k
views
isro-2020
compiler-design
grammar
parsing
easy
0
votes
0
answers
99
Ullman (Compiler Design) Edition 2 Exercise 5.2 Question 6 (Page No. 317)
Implement Algorithm $3.23$, which converts a regular expression into a nondeterministic finite automaton, by an L-attributed SDD on a top-down parsable grammar. Assume that there is a token char representing any ... never before returned by this function. Use any convenient notation to specify the transitions of the $NFA$.
admin
asked
in
Compiler Design
Sep 6, 2019
by
admin
827
views
ullman
compiler-design
syntax-directed-translation
regular-expression
finite-automata
parsing
0
votes
1
answer
100
Ullman (Compiler Design) Edition 2 Exercise 5.2 Question 5 (Page No. 317)
This grammar generates binary numbers with a "decimal" point: $S\rightarrow L.L\mid L$ $L\rightarrow LB\mid B$ $B\rightarrow 0\mid 1$ Design an S-attributed SDD to compute $S.val$, the decimal-number value of an input string. For example, the translation of string $101.101$ should be the decimal number $5.625$.
admin
asked
in
Compiler Design
Sep 6, 2019
by
admin
5.4k
views
ullman
compiler-design
syntax-directed-translation
grammar
parsing
0
votes
0
answers
101
Ullman (Compiler Design) Edition 2 Exercise 5.2 Question 4 (Page No. 317)
This grammar generates binary numbers with a "decimal" point: $S\rightarrow L.L\mid L$ $L\rightarrow LB\mid B$ $B\rightarrow 0\mid 1$ Design an L-attributed SDD to compute $S.val$, the decimal-number value of ... $L.side$ that tells which side of the decimal point a bit is on.
admin
asked
in
Compiler Design
Sep 6, 2019
by
admin
1.6k
views
ullman
compiler-design
syntax-directed-translation
grammar
parsing
0
votes
0
answers
102
Ullman (Compiler Design) Edition 2 Exercise 5.2 Question 2 (Page No. 317)
For the SDD of Fig. $5.8$, give annotated parse trees for the following expressions: int a,b,c. float w,x,y,z.
admin
asked
in
Compiler Design
Sep 6, 2019
by
admin
1.8k
views
ullman
compiler-design
syntax-directed-translation
parsing
2
votes
0
answers
103
Ullman (Compiler Design) Edition 2 Exercise 5.1 Question 3 (Page No. 310)
For the SDD(SYNTAX-DIRECTED DEFINITIONS ) of Fig. $5.4$, give annotated parse trees for the following expressions: $(3+4)\ast(5+6)n.$ $1\ast2\ast3\ast(4+5)n.$ $(9+8\ast(7+6)+5)\ast 4n.$
admin
asked
in
Compiler Design
Sep 6, 2019
by
admin
2.0k
views
ullman
compiler-design
parsing
syntax-directed-translation
0
votes
1
answer
104
Ullman (Compiler Design) Edition 2 Exercise 5.1 Question 2 (Page No. 310)
Extend the SDD of Fig. $5.4$ to handle expressions as in Fig. $5.1$.
admin
asked
in
Compiler Design
Sep 6, 2019
by
admin
1.9k
views
ullman
compiler-design
syntax-directed-translation
parsing
5
votes
1
answer
105
Ullman (Compiler Design) Edition 2 Exercise 5.1 Question 1 (Page No. 309 - 310)
For the SDD(SYNTAX-DIRECTED DEFINITIONS ) of Fig. $5.1$, give annotated parse trees for the following expressions: $(3+4)\ast(5+6)n.$ $1\ast2\ast3\ast(4+5)n.$ $(9+8\ast(7+6)+5)\ast 4n.$
admin
asked
in
Compiler Design
Sep 6, 2019
by
admin
40.2k
views
ullman
compiler-design
syntax-directed-translation
parsing
2
votes
0
answers
106
Ullman (Compiler Design) Edition 2 Exercise 4.8 Question 2 (Page No. 286 - 287)
In Fig. $4.56$ is a grammar for certain statements, similar to that discussed in Question $4.4.12$. Again, $e$ and $s$ are terminals standing for conditional expressions and "other statements," respectively. Build an LR parsing ... inputs: if e then s ; if e then s end while e do begin s ; if e then s ; end
admin
asked
in
Compiler Design
Aug 20, 2019
by
admin
571
views
ullman
compiler-design
grammar
parsing
lr-parser
descriptive
0
votes
0
answers
107
Ullman (Compiler Design) Edition 2 Exercise 4.8 Question 1 (Page No. 285 - 286)
The following is an ambiguous grammar for expressions with $n$ binary, infix operators, at $n$ ... ambiguous and unambiguous) grammars compare? What does that comparison tell you about the use of ambiguous expression grammars?
admin
asked
in
Compiler Design
Aug 20, 2019
by
admin
697
views
ullman
compiler-design
grammar
ambiguous
parsing
0
votes
1
answer
108
Ullman (Compiler Design) Edition 2 Exercise 4.7 Question 5 (Page No. 278)
Show that the following grammar $S\rightarrow Aa\mid bAc\mid Bc\mid bBa$ $A\rightarrow d$ $B\rightarrow d$ is LR(1) but not LALR(1).
admin
asked
in
Compiler Design
Aug 20, 2019
by
admin
746
views
ullman
compiler-design
grammar
parsing
descriptive
0
votes
1
answer
109
Ullman (Compiler Design) Edition 2 Exercise 4.7 Question 4 (Page No. 278)
Show that the following grammar $S\rightarrow Aa\mid bAc\mid dc\mid bda$ $A\rightarrow d$ is LALR(1) but not SLR(1).
admin
asked
in
Compiler Design
Aug 20, 2019
by
admin
1.5k
views
ullman
compiler-design
grammar
parsing
descriptive
0
votes
0
answers
110
Ullman (Compiler Design) Edition 2 Exercise 4.7 Question 3 (Page No. 278)
For the grammar of Exercise $4.7.1$, use Algorithm $4.63$ to compute the collection of LALR sets of items from the kernels of the $LR(0)$ sets of items.
admin
asked
in
Compiler Design
Aug 20, 2019
by
admin
275
views
ullman
compiler-design
grammar
parsing
descriptive
0
votes
0
answers
111
Ullman (Compiler Design) Edition 2 Exercise 4.7 Question 2 (Page No. 278)
Repeat Exercise $4.7.1$ for each of the (augmented) grammars of Exercise $4.2.2(a)-(g)$.
admin
asked
in
Compiler Design
Aug 20, 2019
by
admin
315
views
ullman
compiler-design
grammar
parsing
descriptive
0
votes
0
answers
112
Ullman (Compiler Design) Edition 2 Exercise 4.6 Question 7 (Page No. 258)
Consider the family of grammars $G_{n}$, defined by: $S\rightarrow A_{i}b_{i}$ for $1\leq i\leq n$ $A_{i} \rightarrow a_{j} A_{i}\mid a_{j}$ for $1\leq i,j\leq n$ and $i\neq j$ Show that: $G_{n}$ ... $LR(0)$ items. $G_{n}$ is $SLR(1)$. What does this analysis say about how large $LR$ parsers can get?
admin
asked
in
Compiler Design
Aug 20, 2019
by
admin
1.0k
views
ullman
compiler-design
grammar
parsing
lr-parser
descriptive
0
votes
0
answers
113
Ullman (Compiler Design) Edition 2 Exercise 4.6 Question 6 (Page No. 258)
Show that the following grammar: $S\rightarrow SA\mid A$ $A\rightarrow a$ is SLR(1) but not LL(1).
admin
asked
in
Compiler Design
Aug 20, 2019
by
admin
459
views
ullman
compiler-design
grammar
parsing
ll-parser
descriptive
2
votes
0
answers
114
Ullman (Compiler Design) Edition 2 Exercise 4.6 Question 5 (Page No. 258)
Show that the following grammar: $S\rightarrow AaAb\mid BbBa$ $A\rightarrow \epsilon$ $A\rightarrow\epsilon$ is LL(1) but not SLR(1).
admin
asked
in
Compiler Design
Aug 20, 2019
by
admin
369
views
ullman
compiler-design
grammar
parsing
ll-parser
descriptive
0
votes
0
answers
115
Ullman (Compiler Design) Edition 2 Exercise 4.6 Question 4 (Page No. 258)
For each of the (augmented) grammars of Question $4.2.2(a)-(g)$ : Construct the SLR sets of items and their GOTO function. Indicate any action conflicts in your sets of items. Construct the SLR-parsing table, if one exists.
admin
asked
in
Compiler Design
Aug 20, 2019
by
admin
308
views
ullman
compiler-design
parsing
slr-item
goto-function
descriptive
0
votes
0
answers
116
Ullman (Compiler Design) Edition 2 Exercise 4.6 Question 3 (Page No. 258)
Show the actions of your parsing table from Question $4.6.2$ on the input $aa \ast a+$.
admin
asked
in
Compiler Design
Aug 20, 2019
by
admin
174
views
ullman
compiler-design
parsing
descriptive
0
votes
0
answers
117
Ullman (Compiler Design) Edition 2 Exercise 4.5 Question 3 (Page No. 241)
Give bottom-up parses for the following input strings and grammars: The input 000111 according to the grammar of $S\rightarrow 0\: S\: 1 \mid 0\: 1$. The input $aaa \ast a + + $according to the grammar of $S\rightarrow S S + \mid SS \ast \mid a$.
admin
asked
in
Compiler Design
Aug 20, 2019
by
admin
257
views
ullman
compiler-design
parsing
grammar
descriptive
1
vote
0
answers
118
Ullman (Compiler Design) Edition 2 Exercise 4.2 Question 2 (Page No. 206 - 207)
Repeat Question $4.2.1$ for each of the following grammars and strings: $S\rightarrow 0S1\mid 01$ with string $000111$. $S\rightarrow +SS\mid \ast SS\mid a$ with string $+\ast aaa$ ... $bfactor\:\rightarrow\:not\:bfactor\mid (bexpr)\mid true\mid false$
admin
asked
in
Compiler Design
Aug 17, 2019
by
admin
722
views
ullman
compiler-design
context-free-grammar
parsing
ambiguous
descriptive
4
votes
1
answer
119
Ullman (Compiler Design) Edition 2 Exercise 4.2 Question 1 (Page No. 206)
Consider the context-free grammar:$S\rightarrow SS + \mid SS {\ast} \mid a$and the string $aa + a{\ast}$. Give a leftmost derivation for the string. Give a rightmost derivation for the string. ... for the string. Is the grammar ambiguous or unambiguous? Justify your answer. Describe the language generated by this grammar.
admin
asked
in
Compiler Design
Aug 7, 2019
by
admin
10.4k
views
ullman
compiler-design
context-free-grammar
parsing
ambiguous
descriptive
1
vote
0
answers
120
Ullman (Compiler Design) Edition 2 Exercise 2.3 Question 2 (Page No. 60)
Construct a syntax-directed translation scheme that translates arithmetic expressions from postfix notation into infix notation. Give annotated parse trees for the inputs $95-2*$ and $952*-$.
admin
asked
in
Compiler Design
Jul 26, 2019
by
admin
1.3k
views
ullman
compiler-design
syntax-directed-translation
parsing
Page:
« prev
1
2
3
4
5
6
7
8
9
...
23
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged parsing
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...