Accession Number:

AD0626472

Title:

A HEURISTIC DERIVATION SEEKER FOR UNIFORM PREFIX LANGUAGES.

Descriptive Note:

Master's thesis,

Corporate Author:

MOORE SCHOOL OF ELECTRICAL ENGINEERING UNIV OF PENNSYLVANIA PHILADELPHIA

Personal Author(s):

Report Date:

1965-09-01

Pagination or Media Count:

310.0

Abstract:

The paper describes the theoretical background and the realization of a program which tries to find the derivation of a prefix word the problem for some classes of uniform prefix languages. The program can be applied to different language specifications which may contain a base alphabet, defined symbols, axioms, a substitution rule and transformation rules. The specification is similar to formalized logic, but is capable of expressing a much broader class of languages. The program reduces the problem to a Syntactic Normal Form and tries to find its derivation from the ad hoc productions of the language by using a heuristic goal-subgoal method i.e., one which does not guarantee success, but usually results in better performance. The paper also contains a proof that it is sufficient to work with the Normal Form instead of the original problem. Author

Subject Categories:

  • Linguistics
  • Computer Programming and Software
  • Computer Hardware

Distribution Statement:

APPROVED FOR PUBLIC RELEASE