Skip to main content
Article thumbnail
Location of Repository

Constructing functional programs for grammar analysis problems

By J.T. Jeuring and S.D. Swierstra

Abstract

This paper discusses the derivation of functional programs for grammar analysis problems, such as the Empty problem and the Reachable problem. Grammar analysis problems can be divided into two classes: top-down problems such as Follow and Reachable, which are described in terms of the contexts of nonterminals, and bottom-up problems such as Empty and First, which do not refer to contexts. In a previous paper we derive a program for bottom-up grammar analysis problems. In this paper we derive a program for top-down grammar analysis problems by transforming the specification of an arbitrary top-down problem into a program. The existence of a solution is guaranteed provided some natural conditions are satisfied. Furthermore, we describe a general transformation that applies to both classes of grammar analysis problems. The general transformation avoids unnecessary computations in the computation of a fixed point. Constructor classes, which are used to abstract from the notions bottom-up and top-down, are an essential ingredient of the latter derivation

Topics: Wiskunde en Informatica
Year: 1995
OAI identifier: oai:dspace.library.uu.nl:1874/20908
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://dspace.library.uu.nl:80... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.