Normal form approach to compiler design (Q1323320): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q122442545, #quickstatements; #temporary_batch_1706515227281 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q122442545 / rank | |||
Normal rank |
Revision as of 09:01, 29 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Normal form approach to compiler design |
scientific article |
Statements
Normal form approach to compiler design (English)
0 references
2 June 1994
0 references
This paper demonstrates how reduction to normal form can help in the design of a correct compiler for Dijkstra's guarded command language. The compilation strategy is to transform a source program, by a series of algebraic manipulations, into a normal form which describes the behaviour of a stored-program computer. Each transformation elminates high-level language constructs in favour of lower-level constructs. The correctness of the compiler follows from the correctness of each of the algebraic transformations.
0 references
compiler design
0 references
reduction to normal form
0 references
Dijkstra's guarded command language
0 references
correctness
0 references
algebraic transformations
0 references