This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Transformational Derivation of a Parsing Algorithm in a High-Level Language
January 1981 (vol. 7 no. 1)
pp. 23-31
E. Deak, Bell Laboratories
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.
Index Terms:
verification, Algorithm specification, high-level language, partial correctness, source-to-source transformation
Citation:
E. Deak, "A Transformational Derivation of a Parsing Algorithm in a High-Level Language," IEEE Transactions on Software Engineering, vol. 7, no. 1, pp. 23-31, Jan. 1981, doi:10.1109/TSE.1981.230816
Usage of this product signifies your acceptance of the Terms of Use.