Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by akankshadewangan24
0
votes
121
GATE CSE 2017 Set 2 | Question: 32
Consider the following expression grammar $G$: $E \rightarrow E-T \mid T$ $T \rightarrow T + F \mid F$ $F \rightarrow (E) \mid id$ Which of the following grammars is not left recursive, but is equivalent to $G$? $E \rightarrow E-T \mid T$ ... $E \rightarrow TX \mid (TX)$ $X \rightarrow -TX \mid +TX \mid \epsilon$ $T \rightarrow id$
Consider the following expression grammar $G$:$E \rightarrow E-T \mid T$$T \rightarrow T + F \mid F$$F \rightarrow (E) \mid id$Which of the following grammars is not left...
11.0k
views
answered
Apr 10, 2017
Compiler Design
gatecse-2017-set2
grammar
+
–
Page:
« prev
1
2
3
4
5
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register