27 Mar 2005 17:32:28 -0500

Related articles |
---|

Examples of LR(k) grammars (k > 1) sought zlaski@ziemas.net (Ziemowit Laski) (2005-03-27) |

Re: Examples of LR(k) grammars (k > 1) sought nospam@nospam.nospam (Karsten Nyblad) (2005-03-31) |

Re: Examples of LR(k) grammars (k > 1) sought schmitz@i3s.unice.fr (Sylvain Schmitz) (2005-03-31) |

Re: Examples of LR(k) grammars (k > 1) sought zlaski@ziemas.net (Ziemowit Laski) (2005-03-31) |

From: | "Ziemowit Laski" <zlaski@ziemas.net> |

Newsgroups: | comp.compilers |

Date: | 27 Mar 2005 17:32:28 -0500 |

Organization: | Compilers Central |

Keywords: | LR(1), parse, question |

Posted-Date: | 27 Mar 2005 17:32:27 EST |

Hello,

I was wondering if anyone could point me to actual examples of

grammars that are LR(k) but _not_ LALR(k), for k > 1, and/or to an

algorithm for generating such grammars.

Thanks in advance,

--Zem

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.