Most of us have come to realize the increasing importance of parallel computation to our curricula and many of us have included courses in parallel processing in our curricula. Increasingly, however, we have come to feel that parallel processing should be distributed throughout the curriculum. In a great variety of our courses (algorithms, operating systems, programming languages, etc) considerations of parallel computing should be included in our teaching in a substantive way. In this paper we will (1) explore a parallel approach to finding a solution to the membership question, and (2) we will extend the algorithm to exhibit a parse tree for those cases in which the string is in fact a member of the language generated by the grammar. Finally we describe our application of a parallel implementation as a case study and suggest ways that portions of our work may be incorporated into laboratory assignments in the undergraduate curriculum in either a course on theory or one on algorithms.
[1]
Daniel H. Younger,et al.
Recognition and Parsing of Context-Free Languages in Time n^3
,
1967,
Inf. Control..
[2]
Tadao Kasami,et al.
An Efficient Recognition and Syntax-Analysis Algorithm for Context-Free Languages
,
1965
.
[3]
David J. Weir,et al.
Polynomial Time Parsing of Combinatory Categorial Grammars
,
1990,
ACL.
[4]
Jeffrey D. Ullman,et al.
Introduction to Automata Theory, Languages and Computation
,
1979
.
[5]
Karin Harbusch,et al.
An Efficient Parsing Algorithm for Tree Adjoining Grammars
,
1990,
ACL.