Article View: comp.lang.modula2
Article #5003Re: Modula-2 Case of the Reserved Word
From: Pete Davis
Date: Mon, 05 Mar 1990 12:43
Date: Mon, 05 Mar 1990 12:43
4 lines
734 bytes
734 bytes
I don't think a Modula-2 pre-processor would be too difficult at all. All
you would need is a very simple parser to check for reserved words and then
make the conversion. That couldn't take more than 10-15 minutes to write.
_Pete Davis
Technical Details
Message-ID:
<INFO-M2%90030508483293@UCF1VM.BITNET>Path:
arc1-ca.pugleaf.net!utzoo!attcan!uunet!tut.cis.ohio-state.edu!ucbvax!GWUVM.BITNET!HJ647CReferences:
<reid@CTC.CONTEL.COM>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!attcan!uunet!tut.cis.ohio-state.edu!ucbvax!GWUVM.BITNET!HJ647C From: HJ647C@GWUVM.BITNET (Pete Davis) Newsgroups: comp.lang.modula2 Subject: Re: Modula-2 Case of the Reserved Word Message-ID: <INFO-M2%90030508483293@UCF1VM.BITNET> Date: 5 Mar 90 12:43:22 GMT References: <reid@CTC.CONTEL.COM> Sender: daemon@ucbvax.BERKELEY.EDU Reply-To: Modula2 List <INFO-M2%UCF1VM.BITNET@PSUVM.PSU.EDU> Organization: The Internet Lines: 4