Newsgroups: rec.arts.int-fiction
Path: news.duke.edu!newsgate.duke.edu!solaris.cc.vt.edu!news.vt.edu!netnews.com!newsfeed.nyc.globix.net!uunet!ash.uu.net!world!buzzard
From: buzzard@world.std.com (Sean T Barrett)
Subject: Re: English has no grammar? (was: Strange (human?) languages for IF)
Message-ID: <GJ4sAu.1yv@world.std.com>
Date: Tue, 4 Sep 2001 09:13:42 GMT
References: <fd7c35e9.0108120701.613576e7@posting.google.com> <9mt6r4$ane$2@suaar1ac.prod.compuserve.com> <9mvhrd$qb5$3@news.lth.se> <3b940811_2@excalibur.gbmtech.net>
Organization: The World Public Access UNIX, Brookline, MA
Lines: 15
Xref: news.duke.edu rec.arts.int-fiction:92082

John Colagioia <JColagioia@csi.com> wrote:
>This is almost enough to make me wonder if there's any unparseable string of
>English words.

For strings of nouns, the answer leans definitely towards "no, there's
no unparseable string": see my walkthrough-comp after-comp entry,
"BOWL DROP TOY SLEEP PLAY" for examples of taking a given string
of words and extracting arbitrarily long subsequences from it.

   http://emshort.home.mindspring.com/extra.txt

You can just skim for the commands, and then read the immediately
following text to see the command parsed.

SeanB
