<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="tomita-1989-parsing">
    <titleInfo>
        <title>Parsing 2-Dimensional Language</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Masaru</namePart>
        <namePart type="family">Tomita</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>2-Dimensional Context-Free Grammar (2D-CFG) for 2-dimensional input text is introduced and efficient parsing algorithms for 2D-CFG are presented. In 2D-CFG, a grammar rule’s right hand side symbols can be placed not only horizontally but also vertically. Terminal symbols in a 2-dimensional input text are combined to form a rectangular region, and regions are combined to form a larger region using a 2-dimensional phrase structure rule. The parsing algorithms presented in this paper are the 2D-Ear1ey algorithm and 2D-LR algorithm, which are 2-dimensionally extended versions of Earley’s algorithm and the LR(O) algorithm, respectively.</abstract>
    <identifier type="citekey">tomita-1989-parsing</identifier>
    <location>
        <url>https://aclanthology.org/W89-0243</url>
    </location>
    <part>
        <date>1989-08</date>
        <extent unit="page">
            <start>414</start>
            <end>424</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Parsing 2-Dimensional Language
%A Tomita, Masaru
%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 tomita-1989-parsing
%X 2-Dimensional Context-Free Grammar (2D-CFG) for 2-dimensional input text is introduced and efficient parsing algorithms for 2D-CFG are presented. In 2D-CFG, a grammar rule’s right hand side symbols can be placed not only horizontally but also vertically. Terminal symbols in a 2-dimensional input text are combined to form a rectangular region, and regions are combined to form a larger region using a 2-dimensional phrase structure rule. The parsing algorithms presented in this paper are the 2D-Ear1ey algorithm and 2D-LR algorithm, which are 2-dimensionally extended versions of Earley’s algorithm and the LR(O) algorithm, respectively.
%U https://aclanthology.org/W89-0243
%P 414-424

Markdown (Informal)

[Parsing 2-Dimensional Language](https://aclanthology.org/W89-0243) (Tomita, IWPT 1989)

• Parsing 2-Dimensional Language (Tomita, IWPT 1989)

ACL

• Masaru Tomita. 1989. Parsing 2-Dimensional Language. In Proceedings of the First International Workshop on Parsing Technologies, pages 414–424, Pittsburgh, Pennsylvania, USA. Carnegy Mellon University.