Abstract
Operator precedence parsers suffer the disadvantage of parsing invalid as well valid strings. This problem is scrutinized in relation to previous papers of Henderson and Levy (3) and Williams (4) and a parsing algorithm is put forward, capable of parsing a large class of operator precedence grammars.
Get full access to this article
View all access options for this article.