<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-03478172</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-17T15:45:29+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Faster reachability analysis for LR(1) parsers</title>
            <author role="aut">
              <persName>
                <forename type="first">Frédéric</forename>
                <surname>Bour</surname>
              </persName>
              <email type="md5">d6c0271b0a0301e2e8c028545e0acbbb</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="numeric">1120246</idno>
              <idno type="halauthorid" notation="string">1462552-1120246</idno>
              <affiliation ref="#struct-568599"/>
              <affiliation ref="#struct-1008529"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">François</forename>
                <surname>Pottier</surname>
              </persName>
              <email type="md5">1659db34d4bad3a87ea68376a7eaf172</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">francois-pottier</idno>
              <idno type="idhal" notation="numeric">878</idno>
              <idno type="halauthorid" notation="string">16888-878</idno>
              <idno type="IDREF">https://www.idref.fr/090181921</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-4069-1235</idno>
              <orgName ref="#struct-300009"/>
              <affiliation ref="#struct-568599"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>François</forename>
                <surname>Pottier</surname>
              </persName>
              <email type="md5">1659db34d4bad3a87ea68376a7eaf172</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2021-12-13 18:57:56</date>
              <date type="whenModified">2025-10-06 16:54:02</date>
              <date type="whenReleased">2021-12-14 08:34:33</date>
              <date type="whenProduced">2021-10-17</date>
              <date type="whenEndEmbargoed">2021-12-13</date>
              <ref type="file" target="https://inria.hal.science/hal-03478172v1/document">
                <date notBefore="2021-12-13"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-03478172v1/file/bour-pottier-reachability.pdf" id="file-3478172-3050637">
                <date notBefore="2021-12-13"/>
              </ref>
              <ref type="externalLink" target="https://dl.acm.org/doi/pdf/10.1145/3486608.3486903"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="102429">
                <persName>
                  <forename>François</forename>
                  <surname>Pottier</surname>
                </persName>
                <email type="md5">1659db34d4bad3a87ea68376a7eaf172</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-03478172</idno>
            <idno type="halUri">https://inria.hal.science/hal-03478172</idno>
            <idno type="halBibtex">bour:hal-03478172</idno>
            <idno type="halRefHtml">&lt;i&gt;SLE 2021 - ACM SIGPLAN International Conference on Software Language Engineering&lt;/i&gt;, Oct 2021, Chicago, United States. &lt;a target="_blank" href="https://dx.doi.org/10.1145/3486608.3486903"&gt;&amp;#x27E8;10.1145/3486608.3486903&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">SLE 2021 - ACM SIGPLAN International Conference on Software Language Engineering, Oct 2021, Chicago, United States. &amp;#x27E8;10.1145/3486608.3486903&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-3478172-3050637"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="INRIA-ROCQ">INRIA Paris - Rocquencourt</idno>
            <idno type="stamp" n="LORIA2">Publications du LORIA</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="PSL">Université Paris sciences et lettres</idno>
            <idno type="stamp" n="INRIA-PSL">INRIA-PSL</idno>
            <idno type="stamp" n="INRIA-300009">Inria 300009</idno>
            <idno type="stamp" n="CDF-PSL" corresp="PSL">Collège de France - PSL </idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Faster reachability analysis for LR(1) parsers</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Frédéric</forename>
                    <surname>Bour</surname>
                  </persName>
                  <email type="md5">d6c0271b0a0301e2e8c028545e0acbbb</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="numeric">1120246</idno>
                  <idno type="halauthorid" notation="string">1462552-1120246</idno>
                  <affiliation ref="#struct-568599"/>
                  <affiliation ref="#struct-1008529"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">François</forename>
                    <surname>Pottier</surname>
                  </persName>
                  <email type="md5">1659db34d4bad3a87ea68376a7eaf172</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">francois-pottier</idno>
                  <idno type="idhal" notation="numeric">878</idno>
                  <idno type="halauthorid" notation="string">16888-878</idno>
                  <idno type="IDREF">https://www.idref.fr/090181921</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-4069-1235</idno>
                  <orgName ref="#struct-300009"/>
                  <affiliation ref="#struct-568599"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>SLE 2021 -  ACM SIGPLAN International Conference on Software Language Engineering</title>
                  <date type="start">2021-10-17</date>
                  <date type="end">2021-10-19</date>
                  <settlement>Chicago</settlement>
                  <country key="US">United States</country>
                </meeting>
                <imprint>
                  <date type="datePub">2021-10</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1145/3486608.3486903</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Compilers</term>
                <term xml:lang="en">Parsing</term>
                <term xml:lang="en">Error diagnosis</term>
                <term xml:lang="en">Reachability</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-pl">Computer Science [cs]/Programming Languages [cs.PL]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>We present a novel algorithm for reachability in an LR(1) automaton. For each transition in the automaton, the problem is to determine under what conditions this transition can be taken, that is, which (minimal) input fragment and which lookahead symbol allow taking this transition. Our algorithm outperforms Pottier's algorithm (2016) by up to three orders of magnitude on real-world grammars. Among other applications, this vastly improves the scalability of Jeffery's error reporting technique (2003), where a mapping of (reachable) error states to messages must be created and maintained.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-568599" status="VALID">
          <idno type="RNSR">201923244M</idno>
          <idno type="ROR">https://ror.org/01qemch77</idno>
          <orgName>Langages de programmation : systèmes de types, concurrence, preuve de programme</orgName>
          <orgName type="acronym">CAMBIUM</orgName>
          <date type="start">2019-01-01</date>
          <date type="end">2028-12-31</date>
          <desc>
            <address>
              <addrLine>48 Rue Barrault, 75013 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.inria.fr/equipes/cambium</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300026" type="direct"/>
            <relation active="#struct-454310" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-1008529" status="VALID">
          <orgName>Tarides [Paris]</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://tarides.com/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300026" status="VALID">
          <orgName>Collège de France</orgName>
          <orgName type="acronym">CdF (institution)</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-454310" status="VALID">
          <idno type="IdRef">241614864</idno>
          <idno type="RNSR">196718247G</idno>
          <idno type="ROR">https://ror.org/05eyd5d35</idno>
          <orgName>Centre Inria de Paris</orgName>
          <date type="start">2016-03-10</date>
          <desc>
            <address>
              <addrLine>48 Rue Barrault, 75013 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/paris</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
          <orgName type="acronym">Inria</orgName>
          <desc>
            <address>
              <addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>