Parallel <Emphasis Type="Italic">LL</Emphasis> parsing |
| |
Authors: | Ladislav Vagner Bo?ivoj Melichar |
| |
Affiliation: | 1.Department of Computer Science and Engineering,Czech Technical University in Prague,Prague 2,Czech Republic |
| |
Abstract: | A deterministic parallel LL parsing algorithm is presented. The algorithm is based on a transformation from a parsing problem to parallel reduction. First, a nondeterministic version of a parallel LL parser is introduced. Then, it is transformed into the deterministic version—the LLP parser. The deterministic LLP(q,k) parser uses two kinds of information to select the next operation — a lookahead string of length up to k symbols and a lookback string of length up to q symbols. Deterministic parsing is available for LLP grammars, a subclass of LL grammars. Since the presented deterministic and nondeterministic parallel parsers are both based on parallel reduction, they are suitable for most parallel architectures. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|