A Transformational Derivation of a Parsing Algorithm in a High-Level Language
E. Deak · IEEE Transactions on Software Engineering · 1981
This paper presents a detailed algorithm derivation scenario, using correctness preserving source-to-source transfonnations. The algorithm derived is the Cocke-Younger nodal spans parsing algorithm. We describe a high-level SETL-like specification language, and give a partial correctness formalism and a set of transformation rules which enable the combination of algorithms whose partial correctness has already been established.