<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="tanaka-numazaki-1989-parallel">
    <titleInfo>
        <title>Parallel Generalized LR Parsing based on Logic Programming</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Hozumi</namePart>
        <namePart type="family">Tanaka</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Hiroaki</namePart>
        <namePart type="family">Numazaki</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>1989-08</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the First International Workshop on Parsing Technologies</title>
        </titleInfo>
        <name type="personal">
            <namePart type="given">Masaru</namePart>
            <namePart type="family">Tomita</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <originInfo>
            <publisher>Carnegy Mellon University</publisher>
            <place>
                <placeTerm type="text">Pittsburgh, Pennsylvania, USA</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>A generalized LR parsing algorithm, which has been developed by Tomita [Tomita 86], can treat a context free grammar. His algorithm makes use of breadth first strategy when a conflict occcurs in a LR parsing table. It is well known that the breadth first strategy is suitable for parallel processing. This paper presents an algorithm of a parallel parsing system (PLR) based on a generalized LR parsing. PLR is implemented in GHC [Ueda 85] that is a concurrent logic programming language developed by Japanese 5th generation computer project. The feature of PLR is as follows: Each entry of a LR parsing table is regarded as a process which handles shift and reduce operations. If a process discovers a conflict in a LR parsing table, it activates subprocesses which conduct shift and reduce operations. These subprocesses run in parallel and simulate breadth first strategy. There is no need to make some subprocesses synchronize during parsing. Stack information is sent to each subprocesses from their parent process. A simple experiment for parsing a sentence revealed the fact that PLR runs faster than PAX [Matsumoto 87][Matsumoto 89] that has been known as the best parallel parser.</abstract>
    <identifier type="citekey">tanaka-numazaki-1989-parallel</identifier>
    <location>
        <url>https://aclanthology.org/W89-0234</url>
    </location>
    <part>
        <date>1989-08</date>
        <extent unit="page">
            <start>329</start>
            <end>338</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Parallel Generalized LR Parsing based on Logic Programming
%A Tanaka, Hozumi
%A Numazaki, Hiroaki
%Y Tomita, Masaru
%S Proceedings of the First International Workshop on Parsing Technologies
%D 1989
%8 August
%I Carnegy Mellon University
%C Pittsburgh, Pennsylvania, USA
%F tanaka-numazaki-1989-parallel
%X A generalized LR parsing algorithm, which has been developed by Tomita [Tomita 86], can treat a context free grammar. His algorithm makes use of breadth first strategy when a conflict occcurs in a LR parsing table. It is well known that the breadth first strategy is suitable for parallel processing. This paper presents an algorithm of a parallel parsing system (PLR) based on a generalized LR parsing. PLR is implemented in GHC [Ueda 85] that is a concurrent logic programming language developed by Japanese 5th generation computer project. The feature of PLR is as follows: Each entry of a LR parsing table is regarded as a process which handles shift and reduce operations. If a process discovers a conflict in a LR parsing table, it activates subprocesses which conduct shift and reduce operations. These subprocesses run in parallel and simulate breadth first strategy. There is no need to make some subprocesses synchronize during parsing. Stack information is sent to each subprocesses from their parent process. A simple experiment for parsing a sentence revealed the fact that PLR runs faster than PAX [Matsumoto 87][Matsumoto 89] that has been known as the best parallel parser.
%U https://aclanthology.org/W89-0234
%P 329-338

Markdown (Informal)

[Parallel Generalized LR Parsing based on Logic Programming](https://aclanthology.org/W89-0234) (Tanaka & Numazaki, IWPT 1989)

• Parallel Generalized LR Parsing based on Logic Programming (Tanaka & Numazaki, IWPT 1989)

ACL

• Hozumi Tanaka and Hiroaki Numazaki. 1989. Parallel Generalized LR Parsing based on Logic Programming. In Proceedings of the First International Workshop on Parsing Technologies, pages 329–338, Pittsburgh, Pennsylvania, USA. Carnegy Mellon University.