Related articles |
---|
syntax complexity gah4@u.washington.edu (gah4) (2023-02-15) |
Re: syntax complexity tkoenig@netcologne.de (Thomas Koenig) (2023-02-16) |
Re: syntax complexity DrDiettrich1@netscape.net (Hans-Peter Diettrich) (2023-02-16) |
Re: syntax complexity gah4@u.washington.edu (gah4) (2023-02-16) |
Re: syntax complexity gah4@u.washington.edu (gah4) (2023-02-16) |
Re: syntax complexity costello@mitre.org (Roger L Costello) (2023-02-20) |
Re: syntax complexity gah4@u.washington.edu (gah4) (2023-02-20) |
Re: syntax complexity gneuner2@comcast.net (George Neuner) (2023-02-20) |
Re: syntax complexity anton@mips.complang.tuwien.ac.at (2023-02-21) |
[5 later articles] |
From: | Hans-Peter Diettrich <DrDiettrich1@netscape.net> |
Newsgroups: | comp.compilers |
Date: | Thu, 16 Feb 2023 12:03:02 +0100 |
Organization: | Compilers Central |
References: | 23-02-045 |
Injection-Info: | gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="49770"; mail-complaints-to="abuse@iecc.com" |
Keywords: | syntax |
Posted-Date: | 16 Feb 2023 12:57:49 EST |
In-Reply-To: | 23-02-045 |
On 2/16/23 12:08 AM, gah4 wrote:
> I started this in another thread, but I think it deserves its own.
>
> The question is, how does one measure syntax complexity,
In the original thread I was missing more specific distinctions:
- tools: flex/bison, ANTLR, CoCo/R...
- parser types: LL, LR, LF, LALR...
- or(?): recursive-descent, shift-reduce...
- grammar syntax: BNF, EBNF...
- grammar types: context-free, -sensitive...
> with the
> specific case of Fortran vs. PL/I. (And ignoring syntax vs. semantics,
> for now.)
[...]
On that aspect I can not contribute anything, sorry :-(
> One complication I see, is that syntax complexity as seen by people,
> might be different from it as seen by programs.
How do programs recognize syntax complexity?
Number of rules and exceptions?
DoDi
Return to the
comp.compilers page.
Search the
comp.compilers archives again.