From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=0.7 required=5.0 tests=BAYES_00,INVALID_DATE,
	MSGID_SHORT,REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no
	version=3.4.4
Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sun-barr!olivea!uunet!zaphod.mps.ohio-state.edu!unix.cis.pitt.edu!dsinc!netnews.upenn.edu!platypus!jaguar.ucs.uofs.edu
From: raj1@jaguar.ucs.uofs.edu (JACOBS ROBERT A.)
Newsgroups: comp.lang.ada
Subject: Asking for Help.
Message-ID: <527@platypus.uofs.edu>
Date: 3 May 91 17:22:32 GMT
Sender: news@platypus.uofs.edu
Reply-To: raj1@jaguar.ucs.uofs.edu
Organization: University of Scranton
Nntp-Posting-Host: jaguar.ucs.uofs.edu
List-Id: <comp.lang.ada>

Does anyone have a program to read a collection of valid assignment statements
and interpret them using a recursive descent parcer?