ISSN:
1572-9125
Keywords:
Syntax-directed
;
processor
;
bottom-up
;
parsing
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract Some bottom-up syntax-directed parsing processors use a rectangular Boolean matrix called an applicability matrix to determine which rules might be used in the syntax analysis of an input string of terminal (basic) characters of a given language. By constructing a graph derived from the rules of a language specified in Backus Normal Form, and imposing a partial order on the vertices of this graph, it is shown in this paper that the applicability matrix may be partitioned into 2 submatrices, one of which is rectangular, and the other uppertriangular.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01933435
Permalink