🚀 go-pugleaf

In article <EIVERSON.90Nov12212535@thrinakia.nmsu.edu> eiverson@nmsu.edu (Eric Iverson) writes:

> I am in the process of writing a parser in Parlog on the Sequent
> Symmetry and am having a rather difficult time of it.  I am beginning
> to suspect that it is Parlog and not me that is at fault.  One main
> reason for this suspicion is that I typed in a parser program from
> Conlon's "Programming in Parlog" and it does *not* work.  Let me
> rephrase that.  It does not work *consistently.*  

It has come to my attention that the above statement may be
interpreted to mean that Conlon's parser does not work.  In fact, I
was using this parser as proof that it was IC Parlog that was
misfunctioning.  As it turns out this "misfunction" is actually an
inability to handle deep guards and is not a misfunction at all.  When
I asked if there were any parsers that worked in Parlog, I should have
specified IC Parlog; as Conlon's parser is no doubt perfectly
functional in dialects which handle deep guards.  The question still
stands:  Is there an efficient parallel parser that works under IC
Parlog without crashing it?  Even after minor modification, Conlon's
parser is still generating copious segmentation fault errors in IC
Parlog when run in conjunction with my lexicon lookup routine.  This
does not surprise me, as *everything* I write in IC Parlog seems to
generate segmentation faults and dead child processes given enough
time or processors.  If that doesn't happen, I can usually crash it
after recompiling my code a few times.  Perhaps I have some deep
guards lurking around that are causing these problems.  Why then do
they not cause these problems consistently?  Any help on these matters
would be appreciated.

--
------------------------------------------------------------------------
Eric Iverson				Internet: eiverson@nmsu.edu
Computing Research Lab
Box 30001/3CRL				Life is something to do when
New Mexico State University		you can't get to sleep.
Las Cruces, NM 88003-0001			-Fran Lebowitz
(505) 646-5711