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,...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of computer mathematics Ročník 21; číslo 3-4; s. 205 - 227
Hlavní autor: Salas McClyskey, Carolina Paciencia
Médium: Journal Article
Jazyk:angličtina
Vydáno: Gordon and Breach Science Publishers 01.01.1987
Témata:
ISSN:0020-7160, 1029-0265
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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