A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit <a rel="external noopener" href="https://core.ac.uk/download/pdf/82189959.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
<i title="Elsevier BV">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a>
Leo, .I., A general context-free parsing algorithm running in linear time on every LR(k) grammar without using lookahead, Theoretical Computer Scic 2s; 82 :'13?1) ;tLiiti A new general context-free parsing algorithm is pre<.ented which runs in linear time and space on every LR( k) grammar without using any lookahead and without making use of the LR property. Most of the existing implementations of tabular parsing algorithms, including those using lookahead, can easily be adapted to this new<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(91)90180-a">doi:10.1016/0304-3975(91)90180-a</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mcikgsmte5dxhbojvzkdejp3eu">fatcat:mcikgsmte5dxhbojvzkdejp3eu</a> </span>
more »... rithm without a noteworthy loss of efficiency. For some natural right recursive grammars both the time and space complexity will be improved from n( n') to O(n). This makes this algorithm not only of theoretical but probably of practical interest as well. General context-free parsing and recognition methods are used in applications for which the known linear-time methods are too restricted. he main areas where such general methods are extensively used are systems for the processin languages, speech recognition, and in compiler generating systems. * Present affiliation: Oracle Corporat.on/Oracle Nederland, Rijnzathe 6, 3454 Netherlands. eern, 0304-3975/91/$03.50 @ I991-Etsevier Soience Publishers B.V. ' It can be proved that the time and space complexity of Tomita's algorithm is O(n') where 1 is the maximum length of the productions of the grammar, i.e. I = maxA_+aE " Ig( Aa ).
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190415101546/https://core.ac.uk/download/pdf/82189959.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c8/70/c8700b5e90f16efad563ffc2a6c60df9c63eebab.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(91)90180-a"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>