The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+2 votes
197 views

Consider the following grammar:

  • $S \rightarrow S$
  • $S \rightarrow SS \mid a \mid \epsilon$


Construct the collection of sets of LR (0) items for this grammar and draw its goto graph.

asked in Compiler Design by Veteran (112k points) | 197 views
0
i think this is ambigous grammer try to gererate string "a" you will gate 2 LMD
0
It is ambiguous grammar and we can't parse it by LR(0) parser. right na?

Please log in or register to answer this question.

Related questions



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

44,474 questions
49,930 answers
165,530 comments
65,900 users