Thumbnail
Access Restriction
Subscribed

Author Bell, James R.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Context-free parsing ♦ Transition matrix ♦ Boolean matrices ♦ Syntax ♦ Precedence grammar ♦ Precedence functions
Abstract The 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 algorithm is presented for obtaining the linear precedence functions when given the precedence matrix; this algorithm is shown to possess several computational adavantages.
Description Affiliation: Digital Equipment Corp., Maynard, MA (Bell, James R.)
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 12
Issue Number 10
Page Count 3
Starting Page 567
Ending Page 569


Open content in new tab

   Open content in new tab
Source: ACM Digital Library