Re: How detect cycle in grammar ?

Paul B Mann <paul@paulbmann.com>
Thu, 1 Dec 2011 02:46:16 -0800 (PST)

          From comp.compilers
Related articles
[5 earlier articles]
Re: How detect cycle in grammar ? a.moderacja@gmail.com (Borneq) (2011-11-24)
Re: How detect cycle in grammar ? quinn_jackson2004@yahoo.ca (Quinn Tyler Jackson) (2011-11-25)
Re: How detect cycle in grammar ? gene.ressler@gmail.com (Gene) (2011-11-27)
Re: How detect cycle in grammar ? gene.ressler@gmail.com (Gene) (2011-11-27)
Re: How detect cycle in grammar ? anton@mips.complang.tuwien.ac.at (2011-11-28)
Re: How detect cycle in grammar ? gah@ugcs.caltech.edu (glen herrmannsfeldt) (2011-11-29)
Re: How detect cycle in grammar ? paul@paulbmann.com (Paul B Mann) (2011-12-01)
Re: How detect cycle in grammar ? quinn_jackson2004@yahoo.ca (Quinn Tyler Jackson) (2011-12-02)
Re: How detect cycle in grammar ? gene.ressler@gmail.com (Gene) (2011-12-07)
| List of all articles for this month |
From: Paul B Mann <paul@paulbmann.com>
Newsgroups: comp.compilers
Date: Thu, 1 Dec 2011 02:46:16 -0800 (PST)
Organization: Compilers Central
References: 11-11-041 11-11-045 11-11-050 11-11-057 11-11-066 11-11-068
Keywords: parse, errors
Posted-Date: 02 Dec 2011 00:30:30 EST

The LRSTAR parser generator reports two errors in this grammar:


S -> A|B
A -> A
B -> t




LRSTAR Basic 3.0.137 Copyright 2011 Compilerware.


Input silly.grm


silly.grm(6) : A -> A
silly.grm(6) : ---^
silly.grm(6) : Useless production.


silly.grm(6) : A
silly.grm(6) : ---^
silly.grm(6) : Nonterminal symbol in cycle, cannot derive anything.


0 min 0.000 sec, 0.728 MB, 0 warnings, 2 errors.


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.