Groups | Search | Server Info | Keyboard shortcuts | Login | Register
Groups > comp.compilers > #3387
| From | Hans-Peter Diettrich <DrDiettrich1@netscape.net> |
|---|---|
| Newsgroups | comp.compilers |
| Subject | Re: syntax complexity |
| Date | 2023-02-16 12:03 +0100 |
| Organization | Compilers Central |
| Message-ID | <23-02-047@comp.compilers> (permalink) |
| References | <23-02-045@comp.compilers> |
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
Back to comp.compilers | Previous | Next — Previous in thread | Next in thread | Find similar
syntax complexity gah4 <gah4@u.washington.edu> - 2023-02-15 15:08 -0800
Re: syntax complexity Thomas Koenig <tkoenig@netcologne.de> - 2023-02-16 06:32 +0000
Re: syntax complexity Hans-Peter Diettrich <DrDiettrich1@netscape.net> - 2023-02-16 12:03 +0100
Re: syntax complexity gah4 <gah4@u.washington.edu> - 2023-02-16 11:33 -0800
Re: syntax complexity gah4 <gah4@u.washington.edu> - 2023-02-16 16:08 -0800
Re: syntax complexity Roger L Costello <costello@mitre.org> - 2023-02-20 15:09 +0000
Re: syntax complexity gah4 <gah4@u.washington.edu> - 2023-02-20 09:57 -0800
Re: syntax complexity anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2023-02-21 08:14 +0000
Re: syntax complexity anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2023-02-21 18:39 +0000
Re: ireegular expressions, syntax complexity anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2023-02-22 10:55 +0000
Re: irregular expressions, syntax complexity arnold@freefriends.org (Aharon Robbins) - 2023-02-22 08:53 +0000
Re: irregular expressions, syntax complexity Kaz Kylheku <864-117-4973@kylheku.com> - 2023-02-23 00:34 +0000
Re: syntax complexity George Neuner <gneuner2@comcast.net> - 2023-02-20 13:49 -0500
syntax complexity Christopher F Clark <christopher.f.clark@compiler-resources.com> - 2023-02-21 20:54 +0200
csiph-web