Formal Translation Directed by Parallel LLP Parsing

  • Ladislav Vagner
  • Bořivoj Melichar
Conference paper

DOI: 10.1007/978-3-540-69507-3_46

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4362)
Cite this paper as:
Vagner L., Melichar B. (2007) Formal Translation Directed by Parallel LLP Parsing. In: van Leeuwen J., Italiano G.F., van der Hoek W., Meinel C., Sack H., Plášil F. (eds) SOFSEM 2007: Theory and Practice of Computer Science. SOFSEM 2007. Lecture Notes in Computer Science, vol 4362. Springer, Berlin, Heidelberg

Abstract

Formal translation directed by parallel LLP parsing 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 LLP parser. 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))\).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Ladislav Vagner
    • 1
  • Bořivoj Melichar
    • 1
  1. 1.Czech Technical University in Prague, Department of Computer Science and Engineering, Karlovo nám. 13, 121 35, Prague 2Czech Republic

Personalised recommendations