Re: Detecting endless recursion?

Uli Kusterer <witness@t-online.de>
4 Feb 2004 21:51:07 -0500

          From comp.compilers
Related articles
[19 earlier articles]
Re: Detecting endless recursion? joachim.durchholz@web.de (Joachim Durchholz) (2004-02-01)
Re: Detecting endless recursion? nmm1@cus.cam.ac.uk (2004-02-01)
Re: Detecting endless recursion? derkgwen@HotPOP.com (Derk Gwen) (2004-02-01)
Re: Detecting endless recursion? lex@cc.gatech.edu (Lex Spoon) (2004-02-01)
Re: Detecting endless recursion? bear@sonic.net (Ray Dillinger) (2004-02-04)
Re: Detecting endless recursion? nmm1@cus.cam.ac.uk (2004-02-04)
Re: Detecting endless recursion? witness@t-online.de (Uli Kusterer) (2004-02-04)
Re: Detecting endless recursion? joachim.durchholz@web.de (Joachim Durchholz) (2004-02-08)
Re: Detecting endless recursion? alexc@std.com (Alex Colvin) (2004-02-08)
Re: Detecting endless recursion? cymric73@hotmail.com (Maarten D. de Jong) (2004-02-08)
Re: Detecting endless recursion? kenrose@tfb.com (Ken Rose) (2004-02-12)
Re: Detecting endless recursion? witness@t-online.de (Uli Kusterer) (2004-02-13)
Re: Detecting endless recursion? joachim.durchholz@web.de (Joachim Durchholz) (2004-02-26)
[1 later articles]
| List of all articles for this month |
From: Uli Kusterer <witness@t-online.de>
Newsgroups: comp.compilers
Date: 4 Feb 2004 21:51:07 -0500
Organization: T-Online
References: 04-01-050 04-01-081 04-01-156 04-02-025
Keywords: theory, parse
Posted-Date: 04 Feb 2004 21:51:07 EST

  Joachim Durchholz <joachim.durchholz@web.de> wrote:


> Programming language grammars as shown in textbooks are context-free :-)


  He said to the self-taught programmer ;-)


> (...)
> The next less general class is regular grammars; loosely speaking,
> they are just like context-free grammars but can't do bracketing
> constructs like parentheses in arithmetic expressions (somebody said
> that regular grammars "can't count"). Regular expressions are another
> form of regular grammars. Regular grammars are far easier to parse
> than context-free ones (the regexp package does exactly this).


So I guess I need context-free grammar if I want to do anything useful?


Well, then I guess I already have one?


Confused,
-- Uli
http://www.zathras.de
[Most programming languages are defined by CFGs, with the input being
split using regular expressions into the tokens in the CFG. -John]


Post a followup to this message

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