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
Parsing
[closed]
Mojojojo
asked
in
Unknown Category
Aug 23, 2016
closed
Sep 21, 2020
by
srestha
154
views
1
vote
1
vote
closed with the note:
not in gate
Mojojojo
asked
in
Unknown Category
Aug 23, 2016
closed
Sep 21, 2020
by
srestha
by
Mojojojo
154
views
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
1
vote
1
vote
0
answers
1
LavTheRawkstar
asked
in
Unknown Category
Jun 25, 2016
553
views
Construct the LALR(1) parsing table for this grammar.
Consider the following Grammar S - > V = E E - > F | E+F F - > V | int | (E) V - > id Construct the LALR(1) parsing table for this Grammar.
LavTheRawkstar
asked
in
Unknown Category
Jun 25, 2016
by
LavTheRawkstar
553
views
0
votes
0
votes
2
answers
2
dhruba
asked
in
Compiler Design
Jun 5, 2023
326
views
LR Bottom up parsing table.
dhruba
asked
in
Compiler Design
Jun 5, 2023
by
dhruba
326
views
compiler-design
parsing
0
votes
0
votes
1
answer
3
Souvik33
asked
in
Compiler Design
Dec 20, 2022
475
views
Push Down Automation | Parsing | Input Buffer and Stack
Consider a situation, where the input buffer is still having elements, and our PDA has reached final state. Given that for next input element the final state has no transition defined. In above situation will the i/p string be ... in all cases May be accepted if empty stack acceptance is allowed in the given PDA Something else, I can explain
Souvik33
asked
in
Compiler Design
Dec 20, 2022
by
Souvik33
475
views
theory-of-computation
pushdown-automata
context-free-grammar
0
votes
0
votes
1
answer
4
Souvik33
asked
in
Compiler Design
Dec 11, 2022
669
views
Parsing Table | Shift Reduce Parsers | Numerical Answer
Consider the following statements regarding the Parsing Table of a shift reduce parser, for any given grammar No. of states/ size of parse table is same for all Shift-Reduce Parsers. No. of states/ size of parse table in LR(0), SLR(1 ... CORRECT statement is _______ (For example, if statement 1 and 7 are correct, answer would be 1+7, i.e. 8)
Souvik33
asked
in
Compiler Design
Dec 11, 2022
by
Souvik33
669
views
compiler-design
parsing
lr-parser
numerical-answers
difficult
descriptive
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 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:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy