grammer issue in compiler design

Question

0.00/5 (No votes)

See more:

I was looking through grammar families when I had something I don't fully understand .

how to know/guess/prove/ a grammar belongs to any family ?

for example :

S -> A
A -> B | B a A
B -> b C
C -> C b | C x | epsilon

is it LR(0) ? is it SLR(1) ?
why?
and how u got that!?

thanks

Posted 5-Aug-11 10:32am

fresh_girl

Updated 5-Aug-11 10:33am

v2

Add a Solution

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Andreas Gieriet · Answer 1 · 2011-08-05T11:50:00

The following grammar (given in EBNF) accepts the same language:

S = b { b | x } { a b { b | x } } .

Not really answering your question, though. This one is LL(1).

You might take any decent textbook on that topic and check the definitions for LR(0) and SLR(1).
Of the given productions
- one is obviously left-recursive
- one is obviously right-recursive

Have fun!

Andi