Register

#self doubt

• edited by
408 views
0 0 votes

https://gateoverflow.in/908/Gate-cse-2003-question-18

Here ” In fact only for the L-attributed grammar made from a LL(1) grammar, we can always guarantee a bottom-up parsing. Even for LR(1) grammar, bottom-up parsing is not a guarantee for all inherited attributes.”...I am not getting this line...Can somebody please explain with suitable example?

@Arjun Sir @Deepak Poonie Sir can you please explain

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · self doubtNext → · University of Cincim...
← Previous in category · #self doubtNext in category → · Made easy test
Position:
Show:

Related questions

0 0 votes
0 0 answers
1.6k
1.6k views
shubham02 asked Aug 23, 2018
1,645 views
#self doubt
1. Consider the below SDT: E- E+E {print(+)}E->a {print(a)}What is/are the output(s) for the input string a+a+a ?(i) a+a+a(ii) aa+a+(iii) aaa++(iv) +a+aa(a) Only (i)(b) O...
2 2 votes
4 4 answers
1.9k
1.9k views
Hirak asked Jun 4, 2019
1,882 views
COMPILER DESIGN: Dragon Book self doubt
S→ A/aA→ aLL1 or not?
0 0 votes
1 answers 1 answer
3.0k
3.0k views
Hirak asked Jun 1, 2019
3,043 views
Compiler design Self doubt
S → aSbS /bSaS / ϵS → aABb A→ c/ ϵ B → d/ ϵWhich of the following is LL1. Explain in details.
1 1 vote
0 0 answers
2.2k
2.2k views
aditi19 asked Mar 31, 2019
2,206 views
DAG doubt
How to represent array expressions using DAG?for example a=b[i]+c[j]how to represent this using DAG?