An attributed translation grammar for PL/0
In this paper an attributed translation grammar (abbreviated as ATG) for the PL/0 is defined. The translation achieved by the ATG is the generation of the P-codes, used in the original interpreter by Wirth [7]. Due (o backtracking which may be followed by trimming of subtrees after code generation,...
Saved in:
| Published in: | International journal of computer mathematics Vol. 21; no. 3-4; pp. 205 - 227 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
Gordon and Breach Science Publishers
01.01.1987
|
| Subjects: | |
| ISSN: | 0020-7160, 1029-0265 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In this paper an attributed translation grammar (abbreviated as ATG) for the PL/0 is defined. The translation achieved by the ATG is the generation of the P-codes, used in the original interpreter by Wirth [7]. Due (o backtracking which may be followed by trimming of subtrees after code generation, it is never necessary to have the complete derivation tree. This is true even with recursion. |
|---|---|
| ISSN: | 0020-7160 1029-0265 |
| DOI: | 10.1080/00207168708803567 |