From nobody@digitalkingdom.org Thu Oct 30 13:13:01 2008 Received: with ECARTIS (v1.0.0; list lojban-list); Thu, 30 Oct 2008 13:13:02 -0700 (PDT) Received: from nobody by chain.digitalkingdom.org with local (Exim 4.69) (envelope-from ) id 1Kvdt7-0002MY-OU for lojban-list-real@lojban.org; Thu, 30 Oct 2008 13:13:01 -0700 Received: from rlpowell by chain.digitalkingdom.org with local (Exim 4.69) (envelope-from ) id 1Kvdt7-0002MR-Lw for lojban-list@lojban.org; Thu, 30 Oct 2008 13:13:01 -0700 Date: Thu, 30 Oct 2008 13:13:01 -0700 From: Robin Lee Powell To: lojban-list@lojban.org Subject: [lojban] Re: [lojban-beginners] A challenge for computer science/programming geeks: The LLG wants to give you $500! Message-ID: <20081030201301.GW1092@digitalkingdom.org> Mail-Followup-To: lojban-list@lojban.org References: <20081028215134.GK31434@digitalkingdom.org> <20081030192643.GV1092@digitalkingdom.org> MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline In-Reply-To: User-Agent: Mutt/1.5.18 (2008-05-17) X-archive-position: 14890 X-ecartis-version: Ecartis v1.0.0 Sender: lojban-list-bounce@lojban.org Errors-to: lojban-list-bounce@lojban.org X-original-sender: rlpowell@digitalkingdom.org Precedence: bulk Reply-to: lojban-list@lojban.org X-list: lojban-list On Thu, Oct 30, 2008 at 12:00:35PM -0800, Stephen Pollei wrote: > On 10/30/08, Robin Lee Powell wrote: > > On Thu, Oct 30, 2008 at 11:21:45AM -0800, Stephen Pollei wrote: > > > On 10/28/08, Robin Lee Powell wrote: > > > > > You're wrong, I'm afraid. > > > > http://en.wikipedia.org/wiki/Parsing_expression_grammar#Examples > > > > Look for "The following parsing expression grammar describes the > > classic non-context-free language". > > S => &(A !b) a+ B !c > A => a A? b > B => b B? c > > would will my transformations become > > S => a+ B > A => a A? b > B => b B? c > > all since I specified that ?, *, and + would be non greedy than this > cfg grammar would match whatever that peg grammar matches, only > problem is that it would over match, and would possible have multiple > matches. That's not even remotely the same language. For one thing, there's no way to get to A, so it's actually: S => a+ B B => b B? c which is just a^mb^nc^n, which is a completely different language. You may already understand this, and that's fine, I just want there to be no confusion: a language that is as close to Lojban as that is to a^nb^nc^n is of no use to us, and we won't pay out for it. -Robin -- They say: "The first AIs will be built by the military as weapons." And I'm thinking: "Does it even occur to you to try for something other than the default outcome?" -- http://shorl.com/tydruhedufogre http://www.digitalkingdom.org/~rlpowell/ *** http://www.lojban.org/ To unsubscribe from this list, send mail to lojban-list-request@lojban.org with the subject unsubscribe, or go to http://www.lojban.org/lsg2/, or if you're really stuck, send mail to secretary@lojban.org for help.