search
Log In
1 vote
160 views

in Compiler Design 160 views

1 Answer

0 votes
The given grammar might be wrong!

Related questions

0 votes
3 answers
1
351 views
Is it Possible that any SDT can be L-attributed and S-attributed both in the same question?
asked Mar 28, 2018 in Compiler Design dixit bishwash 351 views
0 votes
0 answers
2
84 views
Implement Algorithm $3.23$, which converts a regular expression into a nondeterministic finite automaton, by an L-attributed SDD on a top-down parsable grammar. Assume that there is a token char representing any character, and that char.$lexval$ is the character it ... that is, a state never before returned by this function. Use any convenient notation to specify the transitions of the $NFA$.
asked Sep 6, 2019 in Compiler Design Lakshman Patel RJIT 84 views
0 votes
1 answer
3
141 views
S → aSbS /bSaS / ϵ S → aABb A→ c/ ϵ B → d/ ϵ Which of the following is LL1. Explain in details.
asked Jun 1, 2019 in Compiler Design Hirak 141 views
0 votes
0 answers
4
152 views
Q1: Consider G :- $X \rightarrow X + Y | Y$ $Y \rightarrow Y*Z|Z$ $Z \rightarrow (X)$ $Z \rightarrow id$ if LR(1) parser is used to parse the above grammar, then total how many lookahead will be present in the dfa state I0 for the items $X \rightarrow .Y \text{ and } Z \rightarrow .id$. My Answer: ... --------------------------------------------------------------- Someone verify all these answers.
asked Nov 8, 2018 in Compiler Design Shubhanshu 152 views
...