Path: csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!feeder.erje.net!us.feeder.erje.net!news.linkpendium.com!news.linkpendium.com!news.iecc.com!.POSTED!nerds-end
From: raniascience1@gmail.com
Newsgroups: comp.compilers
Subject: Re: First Order Logic (FOL) parsing
Date: Sun, 3 May 2015 14:42:52 -0700 (PDT)
Organization: Compilers Central
Lines: 3
Sender: news@iecc.com
Approved: comp.compilers@iecc.com
Message-ID: <15-05-002@comp.compilers>
References: <10-12-016@comp.compilers> <10-12-021@comp.compilers>
NNTP-Posting-Host: news.iecc.com
Mime-Version: 1.0
Content-Type: text/plain; charset=ISO-8859-1
X-Trace: miucha.iecc.com 1430690409 9034 2001:470:1f07:1126:0:676f:7373:6970 (3 May 2015 22:00:09 GMT)
X-Complaints-To: abuse@iecc.com
NNTP-Posting-Date: Sun, 3 May 2015 22:00:09 +0000 (UTC)
Injection-Date: Sun, 03 May 2015 21:42:52 +0000
Keywords: parse, question
Posted-Date: 03 May 2015 18:00:09 EDT
X-submission-address: compilers@iecc.com
X-moderator-address: compilers-request@iecc.com
X-FAQ-and-archives: http://compilers.iecc.com
Xref: csiph.com comp.compilers:1551

I want more examples of FOL in lex/bison and how o prove that it is
LL(1)or LALR