Note on parallel parsing
Journal Article
·
· SIGPLAN Not.; (United States)
Sequential compiling (parsing in particular) received extended attention in the past. With the increased interest in parallel processing, there are efforts to build compilers to generate code for these parallel processors. The parallel parsing methods known thus far split the input sentence into p segments and each segment is processed by a different parser. Except for the parser that gets the first segment, all of the other parsers start in the so-called super initial state and the parsing on all these segments is done left to right. A different method of parallel parsing is proposed in this paper. The proposed method needs two parsers, each processing the input in opposite directions. If this procedure is restricted to deterministic parsing, a different subset of deterministic context free grammars and languages could be introduced. The claims necessary for the proposed method are stated and proved. The possible implications are discussed. 6 references.
- OSTI ID:
- 5136853
- Journal Information:
- SIGPLAN Not.; (United States), Journal Name: SIGPLAN Not.; (United States) Vol. 1; ISSN ASINB
- Country of Publication:
- United States
- Language:
- English
Similar Records
Some theoretical aspects of parallel parsing
First conference of the European chapter of the association for computational linguistics. Proceedings of the conference
Parallel parsing of tree adjoining grammars on the connection machine
Journal Article
·
Sun Feb 28 23:00:00 EST 1982
· Cybernetics (Engl. Transl.); (United States)
·
OSTI ID:6292940
First conference of the European chapter of the association for computational linguistics. Proceedings of the conference
Conference
·
Fri Dec 31 23:00:00 EST 1982
·
OSTI ID:5135442
Parallel parsing of tree adjoining grammars on the connection machine
Journal Article
·
Fri Jan 31 23:00:00 EST 1992
· International Journal of Parallel Programming; (United States)
·
OSTI ID:7249394