A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
A Formalisation of the Normal Forms of Context-Free Grammars in HOL4
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
We describe the formalisation of the Chomsky and Greibach normal forms for context-free grammars (CFGs) using the HOL4 theorem prover. We discuss the varying degrees to which proofs that are straightforward on pen and paper, turn out to be much harder to mechanise. While both proofs are of similar length in their informal presentations, the mechanised proofs for Greibach normal form blow-up considerably.
doi:10.1007/978-3-642-15205-4_11
fatcat:bctvnjpsnbbbfcuvht2vylnorq