Access Restriction

Author Martin, David F.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Context-free parsing ♦ Boolean matrices ♦ Precedence grammars ♦ Precedence functions ♦ Syntax analysis
Abstract A 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, but also provides an indication of why they do not exist, so that corrective action can be taken if possible. Necessary and sufficient conditions for the existence of precedence functions are given. The use of Boolean matrices to prove the existence of precedence functions associated with classes of conflict-free grammars is illustrated through an example.
Description Affiliation: Univ. of California, Los Angeles, Los Angeles (Martin, David F.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 15
Issue Number 6
Page Count 7
Starting Page 448
Ending Page 454

Open content in new tab

   Open content in new tab
Source: ACM Digital Library