30 Dec 2004 01:06:31 -0500

Related articles |
---|

discriminant characteristics of common grammars afkar@mail2world.com (Bilal) (2004-12-30) |

From: | "Bilal" <afkar@mail2world.com> |

Newsgroups: | comp.compilers |

Date: | 30 Dec 2004 01:06:31 -0500 |

Organization: | http://groups.google.com |

Keywords: | parse, theory, question |

Posted-Date: | 30 Dec 2004 01:06:31 EST |

How can I quickly decide whether a given grammar is an LL(1) without

building the predictive parsing table (i.e. without testing if an

LL(1) parser like JAVACC could parse it?)

What are the descriminant characteristics of LL(1) grammars?

I only know that LL(1) (or even LL(k)) grammars can't contain left

recursive proguctions.

And what about LR(0), SLR, LR(1), LALR(1) Grammars?

How can one recognize them without testing them?

What about languages? How can one know if a given language has an LL(1)

grammar?

Thanks in advane.

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.