The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Email or Username
Password
Remember
Login
Register
|
I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
compiler conceptual doubt
0
votes
78
views
WHAT IS A VALID ITEM FOR A VIABLE PREFIX?
CAM SOMEONE EXPLAIN IN EASY WAY.
compiler-design
parsing
lr-parser
asked
Jan 1, 2019
in
Compiler Design
by
sushmita
|
78
views
answer
comment
0
https://gateoverflow.in/244291/handle-in-a-grammar
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Prev.
Next →
← Prev. Qn. in Sub.
Next Qn. in Sub. →
Related questions
0
votes
1
answer
1
Compiler Design LR(1) doubt
Can lookahead symbol be epsilon in LR(1) parsing? and pls give the LR(1) diagram for the following grammar? A->AB | a B->*AC | Cb | ∈ C->+ABc | ∈
asked
Mar 26, 2019
in
Compiler Design
by
aditi19
|
163
views
compiler-design
lr-parser
parsing
parser
+1
vote
0
answers
2
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
asked
Aug 20, 2019
in
Compiler Design
by
Lakshman Patel RJIT
|
63
views
ullman
compiler-design
grammar
parsing
lr-parser
descriptive
0
votes
0
answers
3
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?
asked
Aug 20, 2019
in
Compiler Design
by
Lakshman Patel RJIT
|
62
views
ullman
compiler-design
grammar
parsing
lr-parser
descriptive
0
votes
0
answers
4
Principles of Compiler Design 6.2
$E \rightarrow E + T \hspace{5px} | \hspace{5px} T$ $T \rightarrow TF \hspace{5px} | \hspace{5px} F $ $F \rightarrow F^{*} \hspace{5px} | \hspace{5px} (E) \hspace{5px} | \hspace{5px} a \hspace{5px} | \hspace{5px} b \hspace{5px} | \hspace{5px} \epsilon $ Construct the LALR sets of items and the parse table for the above grammar.
asked
Jun 29, 2018
in
Compiler Design
by
Mk Utkarsh
|
140
views
compiler-design
parsing
lr-parser
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
Interview Experience for MS(R)-IIT Delhi (School of Information Technology)
How am I preparing
PGEE 2020 (CSE) Experience
IIT Tirupati MS Interview 2020
IIT Bombay Mtech RA - interview experience (2020)
Subjects
All categories
General Aptitude
2k
Engineering Mathematics
8.2k
Digital Logic
2.9k
Programming and DS
5k
Algorithms
4.4k
Theory of Computation
6.2k
Compiler Design
2.2k
Operating System
4.6k
Databases
4.2k
CO and Architecture
3.4k
Computer Networks
4.2k
Non GATE
1.2k
Others
1.5k
Admissions
595
Exam Queries
562
Tier 1 Placement Questions
23
Job Queries
71
Projects
19
Unknown Category
1k
Recent Blog Comments
After getting so many mails from you...
Refund will be given for such cases if applied...
@sreejit007 they don't publish any cutoff or...
@ranjanabhi Can you please elaborate what did...
ISI 2019 : Aarushi Aiyyar's answer to How do...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
52,315
questions
60,433
answers
201,778
comments
95,257
users
