The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
122 views
Get LL(1) parsing table for the following grammar
A--> aCDq / aBg
C --> p /Ct / BD / rAB
D--> d
B-->e
in Compiler Design by (5 points) | 122 views

1 Answer

0 votes

May be wrong?

Anyone pls verify:

 

First (C) = p,r,e

by (261 points)
0
We need to have the actual production in the table.

For example in 'A' row and 'a' column, we need to have the productions A--> aCDq / aBg

Similarly we need to correct the other entries in the table
0

Yes this was an example the grammer is not LL(1) as there are two entries in [A,a] . Is this correct?

Columns for g,q,t,$ are empty and is [C,e] = C-> BD???

0
yes, you are right, the grammar is not LL(1) as there are 2 entires in [A,a]

Related questions

0 votes
0 answers
4
asked Dec 20, 2016 in Compiler Design by iita Junior (927 points) | 139 views
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
49,845 questions
54,783 answers
189,424 comments
80,432 users