Skip to main content
SpringerLink
Log in

Systolic parsing of context-free languages

  • Published:
International Journal of Parallel Programming Aims and scope Submit manuscript

Abstract

We report on a new systolic context-free language parsing algorithm. We present both single parse and multiple parse versions of the algorithm. For an input of lengthn the single parse version has a time complexity ofO(n) and a space complexity ofO(n) 2. This equals the performance of the most effcient known single parse algorithm. The space complexity of the multiple parse version is also ofO(n) 2 while its time complexity is ofO(mn) wherem is the number of differenti parses for the input. This equals the time complexity of the most efficient known multiple parse algorithms and brings an improvenment of a factor of logn over its space complexity.

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. O. H. Ibarra, S. M. Kim, and M. A. Palis, Designing Systolic Algorithms Using Sequential Machines,IEEE Transactions on Computers,35(6):531–542, (June 1986).

    Google Scholar 

  2. J. H. Chang, O. H. Ibarra, and M. A. Palis, Parallel Parsing on a One-way Array of Finite-state Machines,IEEE Transactions on Computers,36(1):64–75, (January 1987).

    Google Scholar 

  3. S. R. Kosaraju,Computations on Iterative Automata, Ph.D. Thesis, University of Pennsylvania (1969).

  4. S. R. Kosaraju, Speed of Recognition of Context-free Languages by Array Automata,SIAM Journal of Computing,4(3):331–340 (September 1975).

    Google Scholar 

  5. L. J. Guibas, H. T. Kung, and C. D. Thompson, Direct VLSI Implementation of Combinatorial Algorithms,Caltech Conference on VLSI, pp. 509–525 (January 1979).

  6. Laurent Langlois,Parallel Parsing of Context-Free Languages on an Array of Processors, Ph.D. Thesis, University of Edinburgh, Edinburgh, Scotland (September 1988).

    Google Scholar 

  7. Oscar H. Ibarra and Michael A. Palis, An Efficient All-parses Systolic Algorithm for General Context-free Parsing,International Journal of Parallel Programming.19(4):295–331.

  8. A. Aho and J. D. Ullman,The Theory of Parsing, Translation, and Compiling: Parsing, Volume 1, Prentice-Hall, Englewood Cliffs, New Jersey (1972).

    Google Scholar 

  9. W. L. Ruzzo, Tree-size bounded alternation.Journal of Computer and System Sciences,21:218–235 (1980).

    Google Scholar 

  10. Y. T. Chiang and K. S. Fu, Parallel Parsing Algorithms and VLSI Implementations for Syntactic Pattern Recognition,IEEE Transactions on Pattern Analysis and Machine Intelligence,6(3):302–314 (May 1984).

    Google Scholar 

  11. J. Earley, An Efficient Context-free Parsing Algorithm,Communications of the ACM,13(2):94–102 (1970).

    Google Scholar 

  12. S. L. Graham, M. A. Harrison, and W. L. Ruzzo, On Line Context Language Recognition in Less than Cubic Time,Proc. of the 8th Annual ACM Symposium on the Theory of Computer Science, May 1976).

  13. C. N. Fischer,On Parsing Context Free Languages in Parallel Environments, Ph.D. Thesis, Cornell University (1975).

  14. C. N. Fischer, On Parsing and Compiling Arithmetic Expressions on Vector Computers,ACM Transactions on Programming Languages and Systems,2(2):203–224 (April 1980).

    Google Scholar 

  15. R. M. Schell, Jr.,Methods for Constructing Parallel Compilers for use in a Multiprocessor Environment, Ph.D. Thesis, University of Illinois at Urbana-Champaign (1979).

  16. J. Cohen, T. Hickey, and J. Katcoff, Upper-bounds for Speed-up in Parallel Parsing,Journal of the ACM,29(2):408–428 (1982).

    Google Scholar 

  17. J. Cohen and S. Kolodner, Estimating the Speedup in Parallel Parsing,IEEE Transactions on Software Engineering,11(1):114–124 (January 1985).

    Google Scholar 

  18. D. B. Skillicorn and D. T. Barnarch, Parallel Parsing on the Connection Machine,Information Processing Letters,31(3:111–117 (May 1989).

    Google Scholar 

  19. S. L. Graham and M. A. Harrison, Parsing of General Context-free Languages,Advances in Computers, Vol. 14 (1976).

  20. Jeffrey D. Ullman,Computational Aspect of VLSI, Computer Science Press, Rockville, Maryland (1984).

    Google Scholar 

  21. L. Valiant, General Context-Free Recognition in Less than Cubic Time,Journal of Computer and System Sciences,10(2):308–315 (1975).

    Google Scholar 

  22. W. L. Miranker and A. Winkler, Space-time Representations of Systolic Computational Structures,Computing, Vol. 32 (1984).

  23. P. Gachet, B. Joinnault, and P. Quinton, Synthesizing Sytolic Arrays Using DIASTOL, W. R. Moore, A. P. H. McCabe, and R. Urquhart, (eds.),Systolic Arrays, Adam Hilger, pp. 25–36 (1987).

Download references

Author information

Authors and Affiliations

  1. Université de Montréal, Canada

    Laurent Langlois

Authors
  1. Laurent Langlois
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was supported by Université de Montréal, the Natural Science Engineering Resarch Council of Canada and the Communittee of Vice-Chancellors and Principals of the Universities of the United Kingdom.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Langlois, L. Systolic parsing of context-free languages. Int J Parallel Prog 19, 333–355 (1990). https://doi.org/10.1007/BF01379362

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation