Compiler Design · topic
Syntax trees, DAGs, postfix and three-address code, quadruples, triples and indirect triples, SSA form, array addressing, translation of control flow and Boolean expressions, and backpatching.
The intermediate forms GATE asks about, side by side on the same expressions: syntax trees and DAGs with node counts, postfix notation, three-address code instruction kinds, quadruples, triples and indirect triples with their trade-offs, and static single assignment form with φ-functions. Script-produced TAC with and without common-subexpression reuse, temporary counts, and the value-numbering method that builds a DAG.
A partial preview of the top of the sheet. The full sheet is in the Compiler Design cheat sheet pack.
Syntax-directed generation of three-address code for expressions and assignments, array addressing with the row-major offset formula and its variants, code layouts for if, if-else and while, short-circuit (jumping) code for Boolean expressions, and backpatching with truelist, falselist and nextlist on a fully traced example that the script generated instruction by instruction. Includes a solved past question on one-pass translation.
A partial preview of the top of the sheet. The full sheet is in the Compiler Design cheat sheet pack.
