Return-Path: Delivery-Date: Received: from ted.cs.uidaho.edu (no rfc931) by swan.cl.cam.ac.uk with SMTP (PP-6.4); Thu, 21 Jan 1993 17:45:13 +0000 Received: by ted.cs.uidaho.edu (16.6/1.34) id AA18571; Thu, 21 Jan 93 09:15:53 -0800 Sender: info-hol-request@edu.uidaho.cs.ted Errors-To: info-hol-request@edu.uidaho.cs.ted Precedence: bulk Received: from snake.cs.uidaho.edu by ted.cs.uidaho.edu (16.6/1.34) id AA18566; Thu, 21 Jan 93 09:15:48 -0800 Received: by snake.cs.uidaho.edu id AA17284 (5.65c/IDA-1.4.4 for info-hol@ted.cs.uidaho.edu); Thu, 21 Jan 1993 09:15:22 -0800 Date: Thu, 21 Jan 1993 09:15:22 -0800 From: Chris Toshok Message-Id: <199301211715.AA17284@snake.cs.uidaho.edu> To: info-hol@edu.uidaho.cs.ted Subject: Left recursive parser I am interested in writing a parser for a left-recursive grammar, namely that of C, in hol. The parser library in the hol distribution won't handle left recursive grammars, and I don't really want to take the time or energy to eliminate the left-recursion from the grammar. Is there anyone who has had any luck building parsers in hol for left-recursive grammars? Any help would be appreciated. Chris Toshok (toshok@snake.cs.uidaho.edu)