The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
98 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 (98k points) | 98 views

Please log in or register to answer this question.



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

29,017 questions
36,844 answers
91,378 comments
34,721 users