Formal Translation Directed by Parallel LLP Parsing

Authors:
Ladislav Vagner;Bořivoj Melichar
Affiliations:
Czech Technical University in Prague, Department of Computer Science and Engineering, Karlovo nám. 13, 121 35, Prague 2, Czech Republic;Czech Technical University in Prague, Department of Computer Science and Engineering, Karlovo nám. 13, 121 35, Prague 2, Czech Republic
Venue:
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Year:
2007

Citing 3
Cited 0

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Parallel parsing on the connection machine

Information Processing Letters
Efficient EREW PRAM Algorithms for Parentheses-Matching

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Formal translation directed by parallel LLPparsing is presented here. The translator follows the traditional translation scheme --- the input grammar is extended by output symbols that are added into appropriate right-hand sides of grammar rules. The translation algorithm is based on the intermediate results provided by the parallel LLPparser. The correct sequence of output symbols is obtained from the intermediate results using the parallel prefix sum, the segmented parallel prefix sum, and parallel sorting steps. The translation algorithm presented here is suitable for all translations with LLP(q,k) input grammars. The asymptotical parallel time of the translation algorithm is ${\mathcal O}(\log^2(n))$.