Export Citations
3 Results for: Keyword: context-free parsing
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
Searched The ACM Guide to Computing Literature (3,834,882 records)|Limit your search to The ACM Full-Text Collection (773,134 records)
Select All
- articleJune 1972
A Boolean matrix method for the computation of linear precedence functions
Communications of the ACM (CACM), Volume 15, Issue 6Pages 448–454https://doi.org/10.1145/361405.361413A modified version of Bell's Boolean matrix method for the computation of linear precedence functions associated with a conflict-free matrix of precedence relations is given. This algorithm not only detects when the precedence functions do not exist, ...
- articleOctober 1969
A new method for determining linear precedence functions for precedence grammars
Communications of the ACM (CACM), Volume 12, Issue 10Pages 567–569https://doi.org/10.1145/363235.363255The precedence relations of a precedence grammar can be precisely described by a two-dimensional precedence matrix. Often the information in the matrix can be represented more concisely by a pair of vectors, called linear precedence functions. A new ...