Skip to main content
SpringerLink
Log in

On parsing arithmetic expressions in a multiprocessing environment

  • Published:
Acta Informatica Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Summary

Some decomposition of the parsing of the sentences of context-free grammars into sequences of independant sub-tasks is proposed. An example of grammar is presented, for which this decomposition provides an efficient parser for a multiprocessing environment. The average speed-up resulting from the parallelization of the parser of an arithmetic infix grammar is evaluated by means of probabilistic models and real world measurements.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Baer, J.L., Ellis, C.S.: Model, design, and evaluation of a compiler for a parallel processing environment. IEEE soft. Eng. 3, N∘ 6 (1977)

    Google Scholar 

  2. Banatre, J.P., Routeau, J.P., Trilling, L.: An event driven compiling technique. In: Communications of the ACM, Vol. 22, N∘ 1 (1979)

  3. Fisher, C.N.: On parsing and compiling arithmetic expressions on vector computers. ACM Trans. Program. Lang. and Syst. 2, 203–224 (1980)

    Google Scholar 

  4. Gonzales, R.C., Thomason, M.G.: Syntactic pattern recognition. Addison Wesley 1978

  5. Good, I.J.: The number of individuals in the cascade process. Proc. Camb. Phil. Soc. 45, 360–363 (1949)

    Google Scholar 

  6. Gries, D.: Compiler construction for digital computers. John Wiley & Sons, New York 1971

    Google Scholar 

  7. Harris, T.E.: The theory of branching processes. Springer, Berlin 1963

    Google Scholar 

  8. Hopcroft, J.E., Ullman, J.D.: Formal languages and their relation to automata. Addison-Wesley 1969

  9. Mickunas, M., Schell, E.: Parallel compilation in a multiprocessor environment. In: Proc. ACM Annu. Conf. 1978, pp. 241–246

Download references

Author information

Authors and Affiliations

  1. INRIA, Domaine de Voluceau Rocquencourt, BP. 105, F-78150, Le Chesnay, France

    François Baccelli & Thierry Fleury

Authors
  1. François Baccelli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thierry Fleury
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baccelli, F., Fleury, T. On parsing arithmetic expressions in a multiprocessing environment. Acta Informatica 17, 287–310 (1982). https://doi.org/10.1007/BF00264355

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00264355

Keywords

Search

Navigation