A formalisation of the normal forms of context-free grammars in HOL4

Authors:
Aditi Barthwal;Michael Norrish
Affiliations:
Australian National University;Canberra Research Lab., NICTA
Venue:
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Year:
2010

Citing 4
Cited 1

A New Normal-Form Theorem for Context-Free Phrase Structure Grammars

Journal of the ACM (JACM)
Verified Lexical Analysis

Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
Verified, Executable Parsing

ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Mechanisation of PDA and grammar equivalence for context-free languages

WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation

A mechanisation of some context-free language theory in HOL4

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.