Formal Translation Directed by Parallel LLP Parsing

  • Ladislav Vagner
  • Bořivoj Melichar
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4362)


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))\).


Input String Input Symbol Input Language Terminal Symbol Output Symbol 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aho, A.V., Sethi, R., Ullman, J.D.: Compilers – Principles, Techniques, and Tools. Addison-Wesley, London (1986)Google Scholar
  2. 2.
    Skillicorn, D.B., Barnard, D.T.: Parallel Parsing on the Connection Machine. Information Processing Letters 31, 111–117 (1989)zbMATHCrossRefGoogle Scholar
  3. 3.
    Shankar, P.: O(log(n)) Parallel Parsing of a Subclass of LL(1) Languages. In: Parallel Computing, pp. 511–516. Elsevier, Amsterdam (1990)Google Scholar
  4. 4.
    Hill, J.M.D.: Parallel Lexical Analysis and Parsing on the AMT Distributed Array Processor. Parallel Computing 18, 699–714 (1992)zbMATHCrossRefGoogle Scholar
  5. 5.
    Luttighuis, P.O.: Parallel Algorithms for Parsing and Attribute Evaluation. FEBO Druk, Enschede (1993)Google Scholar
  6. 6.
    Vagner, L.: Parallel LL Parsing and Its Applications. PhD. Thesis, CTU Prague (2006), in electronic form:
  7. 7.
    Prasad, S.K., Das, S.K, Chen, C.C.-Y.: Efficient EREW PRAM Algorithms for Parentheses-Matching. IEEE Transactions on Parallel and Distributed Systems 5(9), 995–1008 (1994)CrossRefGoogle Scholar
  8. 8.
    Grama, A., Gupta, A., Karypis, G., Kumar, V.: Introduction to Parallel Computing. Addison-Wesley, London (2003)Google Scholar

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