Abstract Tree Processors with Networks of State Machines as Control: Their use in Programming Language Definition
- Lookup NU author(s)
|
|
|
|
| Author(s) | | Lauer PE |
| Series Editor(s) | | Shaw B |
| Publication type | | Report |
| Series Title | | Computing Laboratory Technical Report Series |
| Year | | 1976 |
| Date | | March 1976 |
| Report Number | | 87 |
| Pages | | 35 |
|
|
|
| Full text is available for this publication: |
|
|
|
|
| Abstract tree processors with networks of state machines as control are introduced as a method for defining programming languages implemented as an interactive programming system. It is claimed that this new method of syntax and semantics definition is superior to extant methods for defining programming languages with respect to the criteria of uniformity and separability. These criteria have been defined to assure respectively that the formal definition is formulated directly in terms of the language the programmer will use in day to day work, and that all run-time information is clearly indicated precisely in those areas where it originates during execution of programs. |
|
|
|
| Institution | | Computing Laboratory, The University of Newcastle upon Tyne |
| Place Published | | Newcastle upon Tyne |
| Actions | |  |
