Scribd
Upload
34 views

1993 Paper 3 Question 5

This document discusses two approaches to compiling a programming language by translating an abstract syntax tree representation of a program into assembly language: (1) using an ad hoc recursive tree walking program, or (2) using an algorithm based on tables automatically generated from tree translation rules. It allocates 10 marks for discussing each approach.

Uploaded by

api-3812391
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
34 views

1993 Paper 3 Question 5

This document discusses two approaches to compiling a programming language by translating an abstract syntax tree representation of a program into assembly language: (1) using an ad hoc recursive tree walking program, or (2) using an algorithm based on tables automatically generated from tree translation rules. It allocates 10 marks for discussing each approach.

Uploaded by

api-3812391
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

1993 Paper 3 Question 5

Programming Language Compilation

Discuss the merits of translating the abstract syntax tree representation of a


program into assembly language by means of

(a) an ad hoc recursive tree walking program [10 marks]

(b) an algorithm based on tables automatically generated from tree translation


rules [10 marks]

You might also like