Re: Detecting endless recursion?

Joachim Durchholz <joachim.durchholz@web.de>
1 Feb 2004 12:53:29 -0500

          From comp.compilers
Related articles
[13 earlier articles]
Re: Detecting endless recursion? lex@cc.gatech.edu (Lex Spoon) (2004-01-22)
Re: Detecting endless recursion? torbenm@diku.dk (2004-01-31)
Re: Detecting endless recursion? witness@t-online.de (Uli Kusterer) (2004-01-31)
Re: Detecting endless recursion? witness@t-online.de (Uli Kusterer) (2004-02-01)
Re: Detecting endless recursion? witness@t-online.de (Uli Kusterer) (2004-02-01)
Re: Detecting endless recursion? joachim.durchholz@web.de (Joachim Durchholz) (2004-02-01)
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? qjackson@shaw.ca (Quinn Tyler Jackson) (2004-02-04)
Re: Detecting endless recursion? bear@sonic.net (Ray Dillinger) (2004-02-04)
Re: Detecting endless recursion? nmm1@cus.cam.ac.uk (2004-02-04)
[8 later articles]
| List of all articles for this month |
From: Joachim Durchholz <joachim.durchholz@web.de>
Newsgroups: comp.compilers
Date: 1 Feb 2004 12:53:29 -0500
Organization: Oberberg Online Infosysteme
References: 04-01-050 04-01-081 04-01-156
Keywords: parse
Posted-Date: 01 Feb 2004 12:53:29 EST

Uli Kusterer wrote:


> I'm not familiar with "context free grammar"s and such stuff (I'm
> mostly self-taught),


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


The next more general class is context-sensitive grammars; these can
express things like type constraints, but there is no widely-known
technique for writing parsers for them, so in practice, they aren't
used except in research.


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).


HTH,
Jo
--
Currently looking for a new job.

Post a followup to this message

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