
Accession Number : AD0742909
Title : Generalized Overlap Resolvable Grammars, Languages, and Parsers.
Descriptive Note : Technical summary rept.,
Corporate Author : WISCONSIN UNIV MADISON MATHEMATICS RESEARCH CENTER
Personal Author(s) : Wise,David Stephen
Report Date : JAN 1972
Pagination or Media Count : 142
Abstract : The class of GOR grammars admits epsilonrules and includes a grammar for every deterministic language. It simple decision procedure yields pairs of problematic phrases, if the grammar is not GOR, or tables used to build a deterministic pushdown parser vary rapidly. The parsing algorithm, based on one of Domolki, takes advantage of the architecture of binary computers by computing state transitions quickly with ligical operations. These computations can be used by a preprocessor to compute an actual state transition table, if desired. This extension yields a still faster parser which can be abandoned temporarily by reverting to the state computing algorithm at anytime, if the original grammer and relations need to be modified. (Author)
Descriptors : (*PROGRAMMING LANGUAGES, GRAMMARS), (*COMPUTATIONAL LINGUISTICS, PROGRAMMING LANGUAGES), ALGORITHMS
Subject Categories : Linguistics
Computer Programming and Software
Distribution Statement : APPROVED FOR PUBLIC RELEASE