Titlebook: Compiler Construction; William M. Waite,Gerhard Goos Textbook 1984 Springer Science+Business Media New York 1984 Clean.algorithms.compiler

接合

Attribute Grammars,t of that node; it is the task of semantic analysis to compute these attributes and check their consistency. Optimization and code generation can be also described in similar terms, using attributes to guide the transformation of the tree and ultimately the selection of machine instructions.

Frenetic

虛弱的神經(jīng)

Error Handling,rmine the cause of the error, but can only diagnose the visible symptoms. Similarly, any repair cannot be considered a . (in the sense that it carries out the user’s intent); it merely neutralizes the symptom so that processing may continue.

HERE

Optimization,om the characteristics of the source language, not to lessen the effects of poor coding by the programmer. These inefficiencies are inherent in the concept of a high level language, which seeks to suppress detail and thereby simplify the task of implementing an algorithm.

Noctambulant

Properties of Real and Abstract Machines,ations onto objects and operations of the target machine. Systematic code generation must, of course, take account of the peculiarities and weaknesses of the target computer’s instruction set. It cannot, however, become bogged down in exploitation of these special idiosyncrasies; the payoff in code

陰謀小團(tuán)體

Charade

engrossed

Attribute Grammars, that node, and hence the tree is often called an . for emphasis. The information collected in the attributes of a node is derived from the environment of that node; it is the task of semantic analysis to compute these attributes and check their consistency. Optimization and code generation can be a

防銹

narcotic