Filters








18,475 Hits in 6.3 sec

Expressive power of LL(k) Boolean grammars

Alexander Okhotin
<span title="">2011</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
by any linear Boolean LL grammars.  ...  The paper studies the family of Boolean LL languages, generated by Boolean grammars and usable with the recursive descent parsing.  ...  Let G be any of the following four families of grammars: Boolean LL(k), conjunctive LL(k), linear Boolean LL(k) and linear conjunctive LL(k).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.tcs.2011.05.013">doi:10.1016/j.tcs.2011.05.013</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mw3g3rip4zferecbwacbfrijou">fatcat:mw3g3rip4zferecbwacbfrijou</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190416005234/https://core.ac.uk/download/pdf/82689634.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/db/aa/dbaa11831460d34699c96ea946b2cd1788f09cb3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.tcs.2011.05.013"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Ch(k) grammars: A characterization of LL(k) languages [chapter]

Anton Nijholt, Eljas Soisalon-Soininen
<span title="">1979</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
produce an LL[K) grammar from a non-Ch [K) grammar.  ...  LL(K)-property.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-09526-8_38">doi:10.1007/3-540-09526-8_38</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/iuf4esbeufcvtciz2lvdytt4oi">fatcat:iuf4esbeufcvtciz2lvdytt4oi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170705223804/http://doc.utwente.nl/66912/1/mfcs1979.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/bd/d6/bdd655c7c26bc638324e6c35bf6cca6e532cbb2b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-09526-8_38"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

On the relationship between the LL(k) and LR(k) grammars

Anton Nijholt
<span title="">1982</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5xfy4fcdxvcvdiybp6iqbffqc4" style="color: black;">Information Processing Letters</a> </i> &nbsp;
In the literature various proofs of the inclusion of the class of LL(k) grammars ir.to the class of LR(k) grammars can be found.  ...  LL(k) grammar is also an LIP(k) grammar.  ...  LL@) grammars are LR(kJ grammars We now show the inclusion of the class of LL(k) grammars in the class of LR(k) grammars. Theorem 2.1. Let k a 0. Any reduced LL(k) grummar is an I.&(k) gram,mar.Roof.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0020-0190(82)90038-2">doi:10.1016/0020-0190(82)90038-2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bax5qfywcfepxju2j4hbfhxuku">fatcat:bax5qfywcfepxju2j4hbfhxuku</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808230612/http://wwwhome.ewi.utwente.nl/~anijholt/artikelen/ipl-2_1982.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/cb/3d/cb3d1af53f70d4467f4690e5901ef986ab535612.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0020-0190(82)90038-2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

On LL-regular grammars

David A. Poplawski
<span title="">1979</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/p6ovb2qpkfenhmb7mcksobrcxq" style="color: black;">Journal of computer and system sciences (Print)</a> </i> &nbsp;
which a grammar is LL-regular are proved.  ...  Several results pertaining to LL-regular grammars are presented.  ...  Since they are analogous to the definitions of strong LL(K) and LL(K) grammars, these two grammar classes are called strong LL-regular and i&regular respectively. DEFINITION 2.1.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0022-0000(79)90031-x">doi:10.1016/0022-0000(79)90031-x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/v6nhdrmah5hjnm3v4fil7quyo4">fatcat:v6nhdrmah5hjnm3v4fil7quyo4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170930162857/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/926/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS8wMDIyMDAwMDc5OTAwMzF4.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/4c/5c/4c5ceffe52c16912a9bd6ae76d0e43f80f187579.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0022-0000(79)90031-x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

A direct algorithm for checking equivalence of LL(k) grammars

Tmima Olshansky, Amir Pnueli
<span title="">1977</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
Our work presents a direct branching algorithm for the general LL(k) grammars equivalence problem. LL(k) word. From now on e will call a cfg simply a grammar-In the sequel we will fix our 324  ...  We deal with the problem of testing equivalence of two LL(k) grammars. The problem had been shown to be decidable for general k by Rosenkrantz and Stearns [2], who so!  ...  The equivalence problem for LL(k) grammars is kno\tlrl to be solvable for quite a while.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(77)90016-0">doi:10.1016/0304-3975(77)90016-0</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fa6brcyxrrejvflfzoi4tjs2wy">fatcat:fa6brcyxrrejvflfzoi4tjs2wy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170924225630/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/1da/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS8wMzA0Mzk3NTc3OTAwMTYw.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/5a/38/5a38b3471ca8df995a4363d42de8c1fad7b8affe.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(77)90016-0"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Adding semantic and syntactic predicates to LL(k): pred-LL(k) [chapter]

Terence J. Parr, Russell W. Quong
<span title="">1994</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
In this paper, we introduce a new LL(k) parser strategy, pred-LL(k), that uses semantic or syntactic predicates to recognize language constructs when normal deterministic LL(k) parsing breaks down.  ...  Most language translation problems can be solved with existing LALR(1) or LL(k) language tools; e.g., YACC [Joh78] or ANTLR [PDC92].  ...  Predicated LL(k) Parsing We denote LL(k) grammars that have been augmented with information concerning the semantic and syntactic context oflookahead decisions as pred-LL(k).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-57877-3_18">doi:10.1007/3-540-57877-3_18</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7ktmzykm3fgozhu3s6no5d45ru">fatcat:7ktmzykm3fgozhu3s6no5d45ru</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20181030112654/https://link.springer.com/content/pdf/10.1007%2F3-540-57877-3_18.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/23/fa/23fabcd04a058dbb62ca9a567ee940089266f1cc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-57877-3_18"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

On LL(k) parsing

Seppo Sippu, Eljas Soisalon-Soininen
<span title="">1982</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fbkexx2qg5anljkxraobuswdq4" style="color: black;">Information and Control</a> </i> &nbsp;
The theory of LL(k) parsing of context-free grammars is developed as a dual of the theory of LR(k) parsing.  ...  An implication of this is that various techniques in the LR(k) theory, e.g., optimization and efficient testing methods, can easily be adopted in the LL(k) theory as well.  ...  Correspondingly, we call LL(Pm,k ) grammars LA(k)LL(m) grammars, and, in particular, LA(k)LL(0) grammars LALL(k) grammars.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0019-9958(82)91016-6">doi:10.1016/s0019-9958(82)91016-6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hcsqj6j3o5fbddvbqqtwgn6mi4">fatcat:hcsqj6j3o5fbddvbqqtwgn6mi4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190418002336/https://core.ac.uk/download/pdf/82675298.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/e0/8a/e08aea50c8b9ad28eaca525d0def910aa989e3ef.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0019-9958(82)91016-6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

The LL(finite) strategy for optimal LL(k) parsing [article]

Peter Belcak
<span title="2021-01-20">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
The LL(finite) parsing strategy for parsing of LL(k) grammars where k needs not to be known is presented.  ...  Modifications to the algorithm are shown that allow for resolution of grammar ambiguities by precedence -- effectively interpreting the input as a parsing expression grammar -- as well as for the use of  ...  LLS(k) grammars The algorithm building LL(f inite) parsers for strong-LL(k) grammars resembles the familiar F IRST, F OLLOW approach more closely than the algorithm for general LL(k) grammars presented  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2010.07874v2">arXiv:2010.07874v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5uydysa7sfgulcqght2qtrbsym">fatcat:5uydysa7sfgulcqght2qtrbsym</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201018031245/https://arxiv.org/pdf/2010.07874v1.pdf" title="fulltext PDF download [not primary version]" 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] <span style="color: #f43e3e;">&#10033;</span> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2010.07874v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

From $LL$-regular to $LL(1)$ grammars : transformations, covers and parsing

Anton Nijholt
<span title="">1982</span> <i title="EDP Sciences"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/pujxd6a3tbb2lfcsnaffdtb4rq" style="color: black;">RAIRO Informatique théorique</a> </i> &nbsp;
grammars has the property that each of its grammars can be transformed to an LL(k) grammar.  ...  In this way we obtain an other generalization of the class of LL (k) grammars, the class of LL-regular or LL (n) grammars.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1051/ita/1982160403871">doi:10.1051/ita/1982160403871</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/dhujdea2vje6riaedw33zvzrhm">fatcat:dhujdea2vje6riaedw33zvzrhm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180720154521/https://www.rairo-ita.org/articles/ita/pdf/1982/04/ita1982160403871.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/fe/e2/fee21b54c2eb4245a793dcf18e9d8d3689dc696d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1051/ita/1982160403871"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars

Etsuji Tomita
<span title="">1983</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/zhlaeph6ondlbeigidexaf7mdy" style="color: black;">Computer Compacts</a> </i> &nbsp;
LL(k) grammars. It is also straightforwardly applicable to a pair of LL(k) grammars, though an LL(k) grammar is not necessarily strict deterministic.  ...  The algorithm is so designed that it can also be applied to a pair of LL(k) grammars without any change, though an LL(K) grammar is not necessarily strict deterministic.  ...  The equivalence checking of two LL(R) grammars While an LL(k) grammar is not necessarily strict deterministic, our algorithm can also be straightforwardly applied to a pair of LL(R) grammars G1 and G2  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0167-7136(83)90163-4">doi:10.1016/0167-7136(83)90163-4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zxrq6i4pwjhsbklqx4xdm53mri">fatcat:zxrq6i4pwjhsbklqx4xdm53mri</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170930003446/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/844/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS8wMzA0Mzk3NTgzOTAwNTJ4.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/ac/72/ac722edfef92e4e54031724bcf44e8361f18cefc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0167-7136(83)90163-4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars

Etsuji Tomita
<span title="">1983</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
LL(k) grammars. It is also straightforwardly applicable to a pair of LL(k) grammars, though an LL(k) grammar is not necessarily strict deterministic.  ...  The algorithm is so designed that it can also be applied to a pair of LL(k) grammars without any change, though an LL(K) grammar is not necessarily strict deterministic.  ...  The equivalence checking of two LL(R) grammars While an LL(k) grammar is not necessarily strict deterministic, our algorithm can also be straightforwardly applied to a pair of LL(R) grammars G1 and G2  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(83)90052-x">doi:10.1016/0304-3975(83)90052-x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/umf6gia3xfgmdjsktn5anmqguu">fatcat:umf6gia3xfgmdjsktn5anmqguu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170930003446/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/844/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS8wMzA0Mzk3NTgzOTAwNTJ4.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/ac/72/ac722edfef92e4e54031724bcf44e8361f18cefc.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(83)90052-x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

On the parsing of LL-regular grammars [chapter]

Anton Nijholt
<span title="">1976</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We prefer to call those grammars strong LLR grammars to obtain a framework analogous to the LL(k) and strong LL(k) grammars.  ...  It will be clear that every strong LLR grammar is LLR and easily can be verified that every LL(k) grammar is LLR.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-07854-1_213">doi:10.1007/3-540-07854-1_213</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2frjstndurb7bpdjamp2ouppr4">fatcat:2frjstndurb7bpdjamp2ouppr4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180719231509/https://ris.utwente.nl/ws/files/6126669/mfcs1976.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/33/f8/33f81c8b07dd9083c287f44b5a937b7709a2f303.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-07854-1_213"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

ANTLR: A predicated-LL(k) parser generator

T. J. Parr, R. W. Quong
<span title="">1995</span> <i title="Wiley"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/afve5b3tavbfzch46mdtazbqla" style="color: black;">Software, Practice &amp; Experience</a> </i> &nbsp;
ANTLR also integrates the description of lexical and syntactic analysis, accepts LL(k) grammars for k > 1 with extended BNF notation, and can automatically generate abstract syntax trees.  ...  Because ANTLR generates LL(k) recursive-descent parsers, with k > 1, ANTLR grammars require less leftfactoring than LL(1) grammars.  ...  ANTLR uses pred-LL(k) grammars, which are LL(k) grammars for k > 1 augmented with predicates. Predicates allow arbitrary semantic and syntactic information to direct the parse.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/spe.4380250705">doi:10.1002/spe.4380250705</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/up5wjeu7incaff2vs4u5tsstaa">fatcat:up5wjeu7incaff2vs4u5tsstaa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20080422171313/http://www.cs.ubc.ca/local/reading/proceedings/spe91-95/spe/vol25/issue7/spe964tp.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/c5/5b/c55bf987abe8ebb81231268f3bda609423f6e532.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/spe.4380250705"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> wiley.com </button> </a>

The equivalence problem for LL- and LR-regular grammars

Anton Nijholt
<span title="">1982</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/p6ovb2qpkfenhmb7mcksobrcxq" style="color: black;">Journal of computer and system sciences (Print)</a> </i> &nbsp;
For example, the classes of U(k) grammars and real-time strict deterministic grammars.  ...  The equivalence problem for context-free grammars is "given two arbitrary grammars, do they generate the same language ?"  ...  The class of LL(k) grammars is properly included in the class of LL-regular grammars and the class of LL(k) languages is properly included in the class of LL-regular languages.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0022-0000(82)90044-7">doi:10.1016/0022-0000(82)90044-7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wh2ic6wcofel5ohovcdwno6cue">fatcat:wh2ic6wcofel5ohovcdwno6cue</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170705121508/http://wwwhome.cs.utwente.nl/~anijholt/artikelen/jcss1982.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/89/b4/89b473f0b36badca22d6d2ac0727f2e0778cc6b7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0022-0000(82)90044-7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

The equivalence problem for LL- and LR-regular grammars [chapter]

Anton Nijholt
<span title="">1981</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
A CFG G is called LL-regular if it is LL(~) × for some regular partition ~ of E • Notice that a grammar G is LL(k) if G is LL(~k) for the regular partition ~k = {{u} i u ~ Z x and lu[ < k} • ({uw I w g  ...  The class of LL(k) grammars is properly included in the class of LL-regular gra~m~ars and the class of LL(k) languages is properly included in the class of LL-regular languages.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-10854-8_32">doi:10.1007/3-540-10854-8_32</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/m6seti7gmzhvbmgt64iaofqntm">fatcat:m6seti7gmzhvbmgt64iaofqntm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171025181057/https://core.ac.uk/download/pdf/21746858.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/1a/b4/1ab4267781e2db87a1bbfe9feb912a84e9e0b001.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-10854-8_32"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 18,475 results