A validating Fermat Parse using the Meta-S Calculus

Quinn Tyler Jackson <qjackson@shaw.ca>
23 May 2002 01:38:47 -0400

          From comp.compilers

Related articles
A validating Fermat Parse using the Meta-S Calculus qjackson@shaw.ca (Quinn Tyler Jackson) (2002-05-23)
| List of all articles for this month |

From: Quinn Tyler Jackson <qjackson@shaw.ca>
Newsgroups: comp.compilers
Date: 23 May 2002 01:38:47 -0400
Organization: Compilers Central
Keywords: parse
Posted-Date: 23 May 2002 01:38:47 EDT


A Validating Fermat Parse Using the -Calculus


This document demonstrates an -grammar, implemented in A-BNF form in
the Meta-S Grammar Development System (next release), that parses a
BASIC-like language called Fermat. The file parsed in this
demonstration is shown in Appendix A. The grammar used is described in
Appendix B. The primary feature demonstrated is the use of predicates
and binding to effect semantic checks during a parse, without any need
for code outside the grammar specification. This is demonstrated by
the successive parsing of a document that is syntactically correct,
but contains semantic errors of various types. To date, Meta-S is the
only grammar development system with features that allow for this
grade of parsing without user-supplied semantic checking code.

Quinn Tyler Jackson

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.