|chomsky and compiler development GenericInfoService@yahoo.com (GenericInfoService) (2001-11-14)|
|Re: chomsky and compiler development email@example.com (Michael J. Fromberger) (2001-11-17)|
|Re: chomsky and compiler development firstname.lastname@example.org (2001-11-17)|
|Re: chomsky and compiler development email@example.com (Marco van de Voort) (2001-11-25)|
|Re: chomsky and compiler development firstname.lastname@example.org (GenericInfoService) (2001-11-25)|
|Re: chomsky and compiler development email@example.com (Joachim Durchholz) (2001-11-29)|
|Re: chomsky and compiler development firstname.lastname@example.org (Lex Spoon) (2001-11-29)|
|Re: chomsky and compiler development TanjBennett@hotmail.com (Tanj) (2001-12-11)|
|Re: chomsky and compiler development email@example.com (2001-12-15)|
|Re: chomsky and compiler development JeffKenton@mediaone.net (Jeff Kenton) (2002-01-03)|
|Date:||25 Nov 2001 22:37:33 -0500|
|Organization:||RoadRunner - TampaBay|
|Posted-Date:||25 Nov 2001 22:37:33 EST|
Much appreciate your reply.
Thanks for the reference to Hopcroft and Ullman. If I discover
additional worthwhile information from some computer experts I know, I
will post it here. One gentleman - an academic who unfortunately I
cannot recall - a few years back opined that without Chomsky we would
not have modern computer compilers without their context-free
grammars. That seemed a little extreme, and I'm glad to get other
Chomsky in his 1993 book Language and Thought (most of the material
was taken from an Academic Conference in NY in which he was the
keynote speaker) articulates some of his Philosophical thinking which
you've captured I think at least fairly well. He has been outspoken
since the 50's in his disdain for Logical Positivism - which is
important to understand as the motivation as well as the culmination
of his Linguistic Research.
Edward G. Nilges <firstname.lastname@example.org> wrote in message
> In 1973, I read FORMAL GRAMMARS AND THEIR RELATION TO AUTOMATA. This
> was by Hopcroft and Ullman and was published by Addison Wesley.
> Hopcroft and Ullman used the Chomsky type hierarchy by name to
> classify formal grammars and to prove correspondence of each type in
> sequence (regular, context free, and context sensitive) to classes of
> formal automata from the finite state machine, to machines with an
> auxiliary stack or stacks, up to Turing complete machines.
Return to the
Search the comp.compilers archives again.