Cyclic Operator Precedence Grammars for Parallel Parsing

TL;DR

This paper introduces cyclic operator precedence grammars, expanding the formalism to include cyclic relations, enabling parallel parsing of complex syntax trees with linear substructures, and aligning their expressive power with existing OPL formalisms.

Contribution

It proposes cyclic operator precedence grammars that remove the acyclicity constraint, allowing for parallel parsing of more complex language structures without losing expressive power.

Findings

Enables parallel parsing of syntax trees with linear substructures.

Maintains equivalence with existing OPL formalisms.

Allows for unranked syntax trees with flat substructures.

Abstract

Operator precedence languages (OPL) enjoy the local parsability property, which essentially means that a code fragment enclosed within a pair of markers -- playing the role of parentheses -- can be compiled with no knowledge of its external context. Such a property has been exploited to build parallel compilers for languages formalized as OPLs. It has been observed, however, that when the syntax trees of the sentences have a linear substructure, its parsing must necessarily proceed sequentially making it impossible to split such a subtree into chunks to be processed in parallel. Such an inconvenience is due to the fact that so far much literature on OPLs has assumed the hypothesis that equality precedence relation cannot be cyclic. This hypothesis was motivated by the need to keep the mathematical notation as simple as possible. We present an enriched version of operator precedence grammars, called cyclic, that allows to use a simplified version of regular expressions in the right hand sides of grammar's rules; for this class of operator precedence grammars the acyclicity hypothesis of the equality precedence relation is no more needed to guarantee the algebraic properties of the generated languages. The expressive power of the cyclic grammars is now fully equivalent to that of other formalisms defining OPLs such as operator precedence automata, monadic second order logic and operator precedence expressions. As a result cyclic operator precedence grammars now produce also unranked syntax trees and sentences with flat unbounded substructures that can be naturally partitioned into chunks suitable for parallel parsing.