|Comments on the simple compiler ment compilers@ima.UUCP (1986-01-07)|
|Relay-Version:||version B 2.10.2 9/12/84; site mit-hermes.ARPA|
|Posting-Version:||Notesfiles $Revision: 188.8.131.52 $; site ima.UUCP|
|Date:||7 Jan 86 02:54:00 GMT|
|Posted:||Mon Jan 6 21:54:00 1986|
|Date-Received:||7 Jan 86 10:46:04 GMT|
|Nf-From:||ima!compilers Jan 6 21:54:00 1986|
[from bowles at CBOSGD (Jeff Bowles)]
"The first pass is about 33k in size, so it is rather large (and almost
commentless...). Its all in C with a lex frontend. No YACC in it."
Odds are good that, if you hand-crafted the lexical analyzer yourself,
which takes little time for most languages where you "obviously" can
tell where a token stops (unlike FORTRAN, in which
DO 10 K = 1.2
has "DO10K" is the first token), you save a lot of space.
"lex" is quite nice for the first cut, but it's a little too big a
weapon to draw when first facing the opponent.
Return to the
Search the comp.compilers archives again.