Re: simple vs complex languages

Jack Crenshaw <jcrens@earthlink.net>
24 May 2003 20:05:14 -0400

          From comp.compilers

Related articles
[18 earlier articles]
Re: simple vs complex languages lex@cc.gatech.edu (Lex Spoon) (2003-05-15)
Re: simple vs complex languages nmm1@cus.cam.ac.uk (2003-05-16)
Re: simple vs complex languages dot@dotat.at (Tony Finch) (2003-05-16)
Re: simple vs complex languages tenger@iSeries-guru.com (Terrence Enger) (2003-05-16)
Re: simple vs complex languages alexc@std.com (Alex Colvin) (2003-05-16)
Re: simple vs complex languages eas-lab@absamail.co.za (2003-05-18)
Re: simple vs complex languages jcrens@earthlink.net (Jack Crenshaw) (2003-05-24)
Re: simple vs complex languages jcrens@earthlink.net (Jack Crenshaw) (2003-05-24)
Re: simple vs complex languages jcrens@earthlink.net (Jack Crenshaw) (2003-05-24)
Re: simple vs complex languages nmm1@cus.cam.ac.uk (2003-05-29)
Re: simple vs complex languages nmm1@cus.cam.ac.uk (2003-05-29)
Re: simple vs complex languages hat@se-46.wpa.wtb.tue.nl (Albert Hofkamp) (2003-05-29)
Re: simple vs complex languages zivca@netvision.net.il (2003-05-29)
[14 later articles]
| List of all articles for this month |

From: Jack Crenshaw <jcrens@earthlink.net>
Newsgroups: comp.compilers
Date: 24 May 2003 20:05:14 -0400
Organization: EarthLink Inc. -- http://www.EarthLink.net
References: 03-04-095
Keywords: design
Posted-Date: 24 May 2003 20:05:14 EDT

Steve_Lipscombe@amat.com wrote:
>
> Robert wrote
>
> >The thing that bothers me about all this fancy parsing technology we
> >have developed over the past few decades is that it is solving an
> >artificial problem. If we didn't design our programming languages to
> >have such doggone complicated syntax, then we would be happy to use
> >hand-written recursive-descent parsers.
> >...
>
> And our moderator replied
>
> >[I don't see why it's artificial. Human languages have very complex
> >grammars. That's how we're wired to work. Why shouldn't computers
> >adapt to us for a change? -John]
>
> I'm with Robert on this one.


Me, too. I understand the notion that I'd rather have the machine do
the work than me. The logical extension of making the program easy
for the machine would be to write it in absolute binary. Then all the
machine has to do is turn 1's and 0's into bytes.


Even so, it strikes me that, given a certain construct (variable
declarations, for example), why would you choose a syntax that's hard
to parse, over one that's easy? Unless there's a compelling advantage
to the programmer for the hard-to-parse construct, I'd go for the one
that's easy. My experience has been that one can usually think of a
construct that's both comfortable for the user _AND_ easy to parse.


> Why make anything needlessly complicated? Just to prove how clever we are?


I think so. So much research has gone into compiler theory and
parsing techniques, to make the parsers able to handle just about
_ANY_ construct, I get the impression that folks want to be sure they
get their money's worth by using it. I'd much prefer the KISS
approach.


Jack


Post a followup to this message

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