Path: utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!uunet!samsung!caen!uflorida!gatech!udel!ee.udel.edu
From: new@ee.udel.edu (Darren New)
Newsgroups: comp.lang.misc
Subject: Re: YACC/LEX Combo for large textual input
Message-ID: <42993@nigel.ee.udel.edu>
Date: 28 Jan 91 19:37:34 GMT
References: <144123.10308@timbuk.cray.com>
Sender: usenet@ee.udel.edu
Organization: University of Delaware
Lines: 21
Nntp-Posting-Host: estelle.ee.udel.edu

In article <144123.10308@timbuk.cray.com> ddickey@aspen04.cray.com (Dan A. Dickey) writes:
>Hi, I'm working on a yacc/lex parser pair that parses a wide variety
>of output.  The problem I have is that the output contains a rather
>large set of words in it, english language words.  I'm wondering if
>there is an easy way of parsing these words with yacc/lex that I'm
>not aware of.  

If you are not stuck with using yacc and lex, and the input to
your parser is (or can be made) line oriented (e.g., compiler
error messages, or some language like FORTRAN or BASIC rather
than C or Pascal), you might want to look at LOME, which I
recently posted to comp.sys.amiga. It also compiles and runs under
SunOS 4.1 and I'm told compiles and runs fine under System V.
Feel free to contact me for more help if you like.
	  -- Darren

-- 
--- Darren New --- Grad Student --- CIS --- Univ. of Delaware ---
----- Network Protocols, Graphics, Programming Languages, 
      Formal Description Techniques (esp. Estelle), Coffee, Amigas -----
              =+=+=+ Let GROPE be an N-tuple where ... +=+=+=