ABOUT INSUFFICIENCY OF GRAMMARS FOR SEMANTIC VALIDITY OF COMPUTER PROGRAMS AND ONTOLOGIES AS AN ALTERNATIVE APPROACH
Project Creator, Formulae (formulae.org) Toluca, Mexico, Laurence R. Ugalde · International Journal of Advanced Research in Computer Science · 2019
The Rice theorem proves that semantic properties of computer programs are not decidable. In this paper it will be proved that grammars are not a sufficient mean to provide semantic validity on computer programs, first as a corollary of the Rice theorem and then as an independent theorem. Once that is proved that they are not sufficient, the use of ontologies are presented as a viable alternative to grammars and the additional benefits they offer. Finally, an implementation of a programming language is presented which is not based in any grammar, but in an ontology.