Path: utzoo!attcan!uunet!lll-winken!claris!hearn
From: hearn@claris.com (Bob Hearn)
Newsgroups: comp.lang.misc
Subject: Re: Language Design
Message-ID: <9162@claris.com>
Date: 23 Mar 89 02:16:13 GMT
References: <5200040@m.cs.uiuc.edu> <12443@watdragon.waterloo.edu> <9122@claris.com> <12606@watdragon.waterloo.edu>
Reply-To: hearn@claris.com (Bob Hearn)
Organization: Claris Corporation, Mountain View CA
Lines: 18

In article <12606@watdragon.waterloo.edu> gvcormack@watdragon.waterloo.edu (Gordon V. Cormack) writes:
>
>A context-free grammar G is a 4-tuple  G = <N,T,P,S> where N is a finite
>set of nonterminal symbols, T (the alphabet) is a finite set of terminal 
>symbols, P is a finite set of production rules of the form  A -> X1 X2 X3 ...
>where A is in N, and X1, X2, X3 are in Union(N,T).  S in N is the Start symbol.
>
>The K&R grammar does not have a finite alphabet. 
>-- 
>Gordon V. Cormack     CS Dept, University of Waterloo, Canada N2L 3G1
>gvcormack@waterloo.EDU  gvcormack@uwaterloo.CA  gvcormac@water.BITNET

Oh.  That's nice to know.  From Scott, who is looking over my shoulder:
"Why are even bothering to argue with these idiots?"
Good question.

Bob Hearn
hearn@claris.com