menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
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
JEST 2021 registrations are open
TIFR GS-2021 Online Application portal
IIT Jodhpur Mtech AI - Interview Expierence (Summer Admission)
Interview experience at IIT Tirupati for MS program winter admission
IITH CSE interview M Tech RA Winter admission 2021
Subjects
All categories
General Aptitude
(2.1k)
Engineering Mathematics
(8.5k)
Digital Logic
(3k)
Programming and DS
(5.1k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.7k)
Databases
(4.3k)
CO and Architecture
(3.5k)
Computer Networks
(4.3k)
Non GATE
(1.2k)
Others
(1.3k)
Admissions
(595)
Exam Queries
(838)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(1.1k)
Recent Blog Comments
seems like you really enjoyed the process.......
I wrote an email to IISC regarding JEST 2021 but...
B.Tech students are eligible only for Integrated...
I tried calling IISC Admission Dept, but they...
Mock 2 are live now.
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Operator Precedence
0
votes
877
views
In Operator precedence parsing, precedence relations are defined,
i. for all pair of non-terminals.
ii. for all pair of terminals.
iii. to delimit the handle.
iv. only for certain pair of terminals.
compiler-design
operator-grammar
asked
Sep 18, 2017
in
Compiler Design
AnilGoudar
877
views
answer
comment
0
is it option b?
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
2
Answers
2
votes
it is Option - (b)
Precedence Relation Table is constructed to decide the priority of the operators, we use a stack here
if(stack.top()<=current->symbol){
stack.push(current->symbol);
current=current->next;
}
else {
stack.pop();
current=current->next;
}
answered
Sep 25, 2017
Salazar
comment
0
But for terminal {$, $} , there is no associativity defined as the ORT(operator relational table ) contains blank entry at [$,$].
Please
log in
or
register
to add a comment.
2
votes
A:-
There are two important properties for operator precedence parsers is that
1)it doesn't appear on the right side of any production
2)no production has two adjacent no terminals
So the answer would be (A) for all pair of non terminals
answered
Jun 20, 2019
Ravijha
comment
Please
log in
or
register
to add a comment.
← Prev.
Next →
← Prev. Qn. in Sub.
Next Qn. in Sub. →
Related questions
1
vote
2
answers
1
356
views
Operator Precedence Parsing.
In operator precedence parsing we have the rule that production cannot have two adjacent non-terminals or an epsilon production, so this production, S--> ab is allowed but not S--> AB, A->a and B->b, though they are giving us the same output. Why so?
In operator precedence parsing we have the rule that production cannot have two adjacent non-terminals or an epsilon production, so this production, S--> ab is allowed but not S--> AB, A->a and B->b, though they are giving us the same output. Why so?
asked
Jun 14, 2019
in
Compiler Design
Hirak
356
views
compiler-design
operator-grammar
parsing
2
votes
0
answers
2
461
views
Operator Precedence Parser
Can anyone explain why operator precedence parsing cannot handle unary minus,and what are the approach to handle it.
Can anyone explain why operator precedence parsing cannot handle unary minus,and what are the approach to handle it.
asked
Nov 16, 2017
in
Compiler Design
junaid ahmad
461
views
compiler-design
operator-grammar
0
votes
3
answers
3
1.3k
views
Operator precedence parsing
asked
Nov 17, 2016
in
Compiler Design
thor
1.3k
views
operator-grammar
parsing
compiler-design
0
votes
0
answers
4
152
views
Compiler Design: Self Doubt on Operator Grammar
Say I have a grammar, S→ AB A→ a B→ b This grammar is not operator grammar as 2 non terminals are lying side by side, but can be converted to an operator grammar. S→ ab , A→ a , B→ b here i have a doubt, operator grammar ... can we operate even two terminal symbols when placed side by side? Isn't it same as placing 2 non-terminal symbol side by side?
Say I have a grammar, S→ AB A→ a B→ b This grammar is not operator grammar as 2 non terminals are lying side by side, but can be converted to an operator grammar. S→ ab , A→ a , B→ b here i have a doubt, operator grammar as the name suggests should have a ... right? how can we operate even two terminal symbols when placed side by side? Isn't it same as placing 2 non-terminal symbol side by side?
asked
Jun 6, 2019
in
Compiler Design
Hirak
152
views
compiler-design
operator-grammar
ullman
...