search
Log In
2 votes
341 views
Can anyone explain why operator precedence parsing cannot handle unary minus,and what are the approach to handle it.
in Compiler Design 341 views

Please log in or register to answer this question.

Related questions

1 vote
2 answers
1
221 views
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 221 views
0 votes
2 answers
2
727 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.
asked Sep 18, 2017 in Compiler Design AnilGoudar 727 views
0 votes
3 answers
3
0 votes
0 answers
4
86 views
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 86 views
...