Awesome q2a theme
0 votes
16 views
How many states are there in LR(0) parsing of the following grammar

$E→ E+T / T$

$T→ T*F  / F$

$F→ (E)/id$
in Compiler Design by (613 points) | 16 views
+1

you can use this to save time while cross checking http://jsmachines.sourceforge.net/machines/slr.html

1 Answer

+1 vote
Best answer

Grammar is not LR(0) but LR(0) automaton has 12 states.

by (815 points)
selected by
0
Thanks a lot.. :)
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users Jan 2020
  1. shashin

    1163 Points

  2. Vimal Patel

    306 Points

  3. Deepakk Poonia (Dee)

    305 Points

  4. Debapaul

    237 Points

  5. Satbir

    192 Points

  6. SuvasishDutta

    137 Points

  7. Pratyush Priyam Kuan

    118 Points

  8. tp21

    108 Points

  9. pranay562

    95 Points

  10. DukeThunders

    94 Points

Monthly Top User and those within 60% of his/her points will get a share of monthly revenue of GO subject to a minimum payout of Rs. 500. Current monthly budget for Top Users is Rs. 75.
2,983 questions
1,509 answers
8,930 comments
89,814 users