Article View: fj.lang.misc
Article #182Re: BNF (Re: genes for language)
From: MORI Koichiro
Date: Wed, 21 May 1997 00:00
Date: Wed, 21 May 1997 00:00
44 lines
2845 bytes
2845 bytes
>>>>> "kono" == Shinji Kono <kono@ie.u-ryukyu.ac.jp> writes: kono> $B2OLn(B $B??<#(B@$BN05eBg>pJs9)3X$G$9!#(B kono> In article <5ljoi6$sfi@utogw.gssm.otsuka.tsukuba.ac.jp> , kono> kuno@gssm.otsuka.tsukuba.ac.jp (Yasushi Kuno) writes >> $B$7$+$7$3$l$C$F!"$I$3$^$G$r9=J82r@O$H$7$F07$$!"$I$3$+$i@h$r0UL#(B >> $B$H$7$F07$&$+$H$$$&LdBj$G$9$M!"7k6I!#(B kono> $B$3$NOCBj$O7k6I$O$=$3$@$H;W$$$^$9!#J8K!;H$C$F<-=q4IM}$9$kE[$O(B kono> $B$$$J$$$7(B($BBl@n$5$s0J30$O(B...)$B!"<B9T;~$N=hM}$^$G4^$a$F9=J82r@O(B kono> $B$H$O$$$$$^$;$s$h$M!#(B $B$=$&$$$($P:#7n=i$a:"$N(B comp.lang.misc $B$G!"F1MM$N5DO@$,$"$C$?$h$&$G$9!#(B <5k40pm$pho@roar.cs.utexas.edu> $B$+$i;O$^$k(B "Chomsky, Languages, etc." $B$H$$$&%9%l%C%I$NCf$G!"(BPaul Wilson $B;a$O(B Lisp $B%^%/%m$N6/NO$5$rNc$K$H$C$F(B context-sensitive grammar $B$d(B transformational grammar $B$N=EMW@-$K$D$$$F(B $B=R$Y$F$$$k$N$G$9$,!"$=$NCf$GH`$OBl@n$5$s(B($B$d;d$d(BAho, Sethi, Ullman)$B$HF1(B $B$8$/!"!VB?$/$N%W%m%0%i%_%s%08@8l$O(B context-free grammar $B$G$OI=8=$G$-$J(B $B$$(B(context-sensitive $B$b$7$/$O$=$l0J>e$NG=NO$NJ8K!$,I,MW(B)$B!W$H=R$Y$F$$$^(B $B$9!#(B $B$H$/$K!"5-;v(B <5kb95h$nd4@roar.cs.utexas.edu> $B$G$N(B > In article <smryan-0105970213130001@10.0.2.15>, !@?*$% <smryan@mail.com> wrote: > >> Some context-free grammars are very difficult to deal with, and some > >> transformational grammars are easy to deal with. The split between > >> CFG's and CSG's is interesting, but it doesn't always mean what > > > >Languages used by computers almost always have a natural LR(k) CF grammar > >(and even LL(k)), > > I don't think this is the case. The context free grammars that real > programming languages "have" does not describe their actual syntax---it > only bounds it. There are important syntactic properties of programms > that cannot be captured by context free grammars. Generally, this > problem is hidden by calling whatever the parser can do syntax, and > whatever it can't do non-syntax of some kind. (Like "static semantics".) $B$H$$$&$"$?$j(B($B:G8e$N(B3$B9T(B)$B!"1T$$0U8+$@$H;W$$$^$9!#(B -- $B?9(B $B8x0lO:(B (MORI Koichiro), kmori@ca2.so-net.or.jp | kmori@lsi-j.co.jp
Technical Details
Message-ID:
<5lu9iu$md@applepie.kmori.ca2.so-net.or.jp>Path:
arc1-ca.pugleaf.net!unknown!not-for-mailReferences:
<5ljoi6$sfi@utogw.gssm.otsuka.tsukuba.ac.jp> <27438.864144535@rananim.ie.u-ryukyu.ac.jp>Show Full Headers
Complete Article Headers
X-Google-Language: Japanese,JIS X-Google-Thread: 10b195,270469d295e36955 X-Google-Attributes: gid10b195,public X-Google-Thread: 10692b,648697ad862a0f43 X-Google-Attributes: gid10692b,public From: kmori@ca2.so-net.or.jp (MORI Koichiro) Subject: Re: BNF (Re: genes for language) Date: 1997/05/21 Message-ID: <5lu9iu$md@applepie.kmori.ca2.so-net.or.jp> X-Deja-AN: 242783729 References: <5ljoi6$sfi@utogw.gssm.otsuka.tsukuba.ac.jp> <27438.864144535@rananim.ie.u-ryukyu.ac.jp> Organization: Inagi-shi, Tokyo, Japan Newsgroups: fj.lang.misc,fj.lang.implementation