Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.compilers > #1051
| From | wclodius@earthlink.net (William Clodius) |
|---|---|
| Newsgroups | comp.compilers |
| Subject | Re: Programming language and IDE design |
| Date | 2013-11-22 18:27 -0700 |
| Organization | Compilers Central |
| Message-ID | <13-11-027@comp.compilers> (permalink) |
| References | (1 earlier) <13-10-017@comp.compilers> <13-11-003@comp.compilers> <13-11-011@comp.compilers> <13-11-016@comp.compilers> <13-11-018@comp.compilers> |
George Neuner <gneuner2@comcast.net> wrote: > On Sat, 16 Nov 2013 15:55:10 +0000, Martin Ward <martin@gkc.org.uk> > wrote: > > >On Friday 08 Nov 2013 at 21:04, George Neuner <gneuner2@comcast.net> wrote: > > > >> The majority of successful languages are LL(k) for small k. It's hard > >> to get much simpler than that for parsing. > > > >C is not LL(K), neither is COBOL, nor C++, nor I think is Java. > >That probably covers the majority of successful languages: > >if "success" is defined as "total lines of code in production". > > They _all_ are LL(k). More specifically, I believe all of your > examples are, at most, LL(2). > > AFAIK, Fortran's DO loop requires the most lookahead of any of the > classic language features: LL(4) [if I'm counting correctly]. > > 10DOI=42 > 10DOI=42,45 > > Card Fortran didn't require whitespace separation. You had to look > ahead to find [or not] the comma to distinguish DO "I = m,n" from the > assignment "DOI = n". In Fortran typically staement classification (and identification of tokens in fixed form) was performed as an initial pass. Once the statement is identified as to whether or not it is an assignment then the syntactic interpretation of the first token is LL(1), and I suspect all tokens including Holleriths. [I wrote some F77 parsers 30 years ago, and there was some reason I needed to deal with the Hollerith strings before the rest of the pre-parse, but I don't remember offhand what it was. -John]
Back to comp.compilers | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Re: Programming language and IDE design Martin Ward <martin@gkc.org.uk> - 2013-11-16 15:55 +0000
Re: Programming language and IDE design Hans-Peter Diettrich <DrDiettrich1@aol.com> - 2013-11-16 19:48 +0100
Re: Programming language and IDE design George Neuner <gneuner2@comcast.net> - 2013-11-18 19:02 -0500
Re: Programming language and IDE design "Steven G. Kargl" <sgk@REMOVEtroutmask.apl.washington.edu> - 2013-11-19 15:36 +0000
Re: Programming language and IDE design George Neuner <gneuner2@comcast.net> - 2013-11-19 12:41 -0500
Re: Parsing Fortran, was Programming language and IDE design glen herrmannsfeldt <gah@ugcs.caltech.edu> - 2013-11-19 20:18 +0000
Re: Parsing Fortran, was Programming language and IDE design glen herrmannsfeldt <gah@ugcs.caltech.edu> - 2013-11-21 21:22 +0000
Re: Programming language and IDE design wclodius@earthlink.net (William Clodius) - 2013-11-22 18:27 -0700
Re: Programming language and IDE design "robin" <robin51@dodo.com.au> - 2013-11-25 10:33 +1100
Re: Programming language and IDE design Martin Ward <martin@gkc.org.uk> - 2013-12-03 15:15 +0000
Re: Programming language and IDE design Hans-Peter Diettrich <DrDiettrich1@aol.com> - 2013-12-05 03:35 +0100
Re: Programming language and IDE design hu47121@usenet.kitty.sub.org (Hannah) - 2014-03-02 00:03 +0000
Re: LL vs LR, was Programming language and IDE design Ivan Godard <ivan@ootbcomp.com> - 2014-03-01 20:31 -0800
Re: LL vs LR, was Programming language and IDE design Kaz Kylheku <kaz@kylheku.com> - 2014-03-02 18:41 +0000
Re: Programming language and IDE design George Neuner <gneuner2@comcast.net> - 2014-03-02 12:21 -0500
Re: Programming language and IDE design Jonathan Thornburg <jonathan@cobalt.astro.indiana.edu> - 2013-11-19 19:39 +0000
csiph-web