Abstract
In this paper, a parallel algorithm is presented for the evaluation of ordered attribute grammars. The parallelism is achieved by constructing the so-called parallel visit sequences and accordingly augmenting the ordinary evaluation driver as well. For experimental purposes, the algorithm has been implemented by simulation
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Chang J. H.et al., Parallel parsing on a one-way array of finite-state machines.IEEE Trans. on Computers, C-36:1 (1987), 64–75.
Chiang Y and Fu K., Parallel parsing algorithm and VLSI implementation for syntactic pattern recognitions.IEEE Trans. Pattern Anal. Machine. Intell.,6: 3(1984), 302–313.
Fang, I., Folds, a declarative formal language definition system. Ph. D. thesis, Reprot STAN-CS-72-329, Computer Science Department, Stanford University, Standford, California, December 1972.
R. Farrow, Attribute grammars and data-flow languages. Proc. of SIGPLAN NOTICES’83.
K. Hwang, F. A. Briggs, Computer architecture and parallel processing. McGraw-Hill, New York, 1984.
U. Kastens, Ordered attributed grammars.Acta Informatica,13: 3 (1980), 229–256.
U. Kastens, B. Hutt and E. Zimmermann, GAG, A practical compiler generator. Lecture Notes in Computer Science 141, Springer-Verlag, 1982.
D. E. Knuth, Semantics of context-free languages.Math. Syst. Theory,2: 2(1968), 127–145.
Richard M. Shell, Jr., Methods for constructing parallel computers for use in a multiprocessor environment. Ph. D. thesis, Computer Science Dept., University of Illinois at Urbana-Champaign, February, 1979.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wang, S., Ye, D. On parallel evaluation of ordered attribute grammars. J. of Comput. Sci. & Technol. 6, 347–354 (1991). https://doi.org/10.1007/BF02948394
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02948394