| Randy M. Kaplan, Constructing Language Processors for Little Languages (includes PC disk), John Wiley (1994) |
....migrate the system to a new hardware base, we can do it gradually) Old code is kept only as long as it is still useful. As we propose many different new interpreters here, we believe that we can rely on the fact that over the last few decades, we have learned how to write them easily and well [21], and that the changes we propose to them are very small. In addition, the compilers do not need to be particularly fast (i.e. they need not be production quality ) since we only have to use them a few times to get the old code into the new interpretation. Changes to the system are made only by ....
Randy M. Kaplan, Constructing Language Processors for Little Languages (includes PC disk), John Wiley (1994)
....programming language (or architecture) not by replacing the old one with a new one, but by adding a new one to work side by side with the old one, with context information used to disambiguate if the expressions (or applications) themselves do not. There are little languages with little parsers [34] to make the connection between language expressions and activity in other servers or databases and ALL of those choices are variable (these can be more dynamic than those in [83] 68] Compatibility is not the issue; NO one language can express all the things we might want to express [16] 7] ....
Randy M. Kaplan, Constructing Language Processors for Little Languages (includes PC disk), John Wiley (1994)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC