1. Good post? |
I have never seen a DFA that uses notation _in_ the states like this question does. I am having a hard time understanding how to find the correct answer. Does anyone know of a book or website where I can see questions like this?

thanks

2. Good post? |
It is indeed a bit strange.

When I faced that problem, I solved it through elimination to be frank.

I know that the final/accepting states have to be the bottom ones, since they are the only ones who end with a DOT.

So, (A) would end on the upper right state (big one), which has no production with a DOT at the end; (B) would be the same thing; (C) cannot be the one, 'cause there's no production from the bottom left state that accepts another b; and (E) is unlikely cause the start state is not a final/accepting state.

I'm sure somebody can explain it better than me.

Wood

3. Good post? |
i think that this is about as good an explanation as there is.

thanks!

4. Good post? |
Wood,
great work!!!

Hey this parsing automaton is very similar to LR parsing automaton that appears in Aho,Ullman Sethi (Compilers)

Keep going great guns....

Cheers'
Laks

5. Good post? |
right Laks ( parser for LR grammar),

just did it today in class .... lemme put it in a better way

the place where the dot is indicates the point you r at .

e.g. while parsing abcd, a.bcd means that you have seen an a and now r expecting a b in the input. similarly ab.cd means that you have seen ab n are expecting c to parse the string correctly.

Thus, when you see abcd. , means you have seen the string completely and hence, the expression is parsed correctly i.e. you have reached a final state.

therefore, X1X2X3X4.... Xn take it from A-> .& to A->&. if A=>..... &.

hth
Vipul.

6. Good post? |
So wood is it always a true statement that if something ends with a dot it is the end statement. Because if that is true then you are right this is an easy one too just disqualify answers and yes D would be the only one that goes to a dot.

Thanks

7. Good post? |
Maybe you guys want to try this one out:

http://www.TestMagic.com/forum/topic.asp?TOPIC_ID=8363

8. Good post? |
The book "Introduction to Automata Theory, Langauages and Computation" by Hopcroft and Ulman talks about this to some extent in chapter 10. Look for the subsection on LR(0) grammars.

Tait

There are currently 1 users browsing this thread. (0 members and 1 guests)

#### Posting Permissions

• You may not post new threads
• You may not post replies
• You may not post attachments
• You may not edit your posts
•

SEO by vBSEO ©2010, Crawlability, Inc.