Relevant bibliographies by topics / LR parsers

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'LR parsers'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'LR parsers.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "LR parsers"

1

Slivnik, Bostjan. "LL conflict resolution using the embedded left LR parser." Computer Science and Information Systems 9, no. 3 (2012): 1105–24. http://dx.doi.org/10.2298/csis111216023s.

Full text
Abstract:
A method for resolving LL(k) conflicts using small LR(k) parsers (called embedded left LR(k) parsers) is described. An embedded left LR(k) parser is capable of (a) producing the prefix of the left parse of the input string and (b) stopping not on the end-of-file marker but on any string from the set of lookahead strings fixed at the parser generation time. The conditions regarding the termination of the embedded left LR(k) parser if used within LL(k) (and similar) parsers are defined and examined in-depth. It is proved that an LL(k) parser augmented with a set of embedded left LR(k) parsers can parse any deterministic context-free grammar in the same asymptotic time as LR(k) parser. As the embedded left LR(k) parser produces the prefix of the left parse, the LL(k) parser augmented with embedded left LR(k) parsers still produces the left parse and the compiler writer does not need to bother with different parsing strategies during the compiler implementation.
APA, Harvard, Vancouver, ISO, and other styles
2

Soisalon-Soininen, Eljas, and Jorma Tarhio. "Looping LR parsers." Information Processing Letters 26, no. 5 (January 1988): 251–53. http://dx.doi.org/10.1016/0020-0190(88)90149-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

KIPPS, JAMES R. "ADVANCED PARSER-GENERATION TECHNOLOGY FOR AI LANGUAGE APPLICATIONS." International Journal on Artificial Intelligence Tools 01, no. 04 (December 1992): 545–61. http://dx.doi.org/10.1142/s0218213092000053.

Full text
Abstract:
A side effect of AI research is the development of programming languages as vehicles for experimentation and demonstration of concepts. These AI languages generally require some form of parser front end, which can be nontrivial to build. Parser generators can ease the task of language development, but commonly available generators use parsing technologies that severely constrain the level of syntactic sophistication, such as allowing at most one symbol of look ahead. Further, these generators are most often targeted for C and Ada applications; parser generators for LISP applications are not widely available. The RAND Advanced Compiler Kit (RACK) is a parser generator for generalized LR parsing and is suitable for AI applications. RACK parsers are unique in their ability to recognize non-LR(k) languages, as well as LR(k) languages for k > 1. RACK is implemented in C and is upwardly compatible with YACC, a widely used parser generator for C applications. RACK generates parsers that interface with C or Common Lisp. RACK also includes features such as arbitrary look-ahead, multiple start symbols, a scanner generator, and a grammar interpreter. In this paper, I describe RACK, its parsing technology, and significant features; I also report performance results comparing RACK to YACC.
APA, Harvard, Vancouver, ISO, and other styles
4

Machanick, P. "Are LR parsers too powerful?" ACM SIGPLAN Notices 21, no. 6 (June 1986): 35–40. http://dx.doi.org/10.1145/14937.14940.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Pottier, François, and Yann Régis-Gianas. "Towards Efficient, Typed LR Parsers." Electronic Notes in Theoretical Computer Science 148, no. 2 (March 2006): 155–80. http://dx.doi.org/10.1016/j.entcs.2005.11.044.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Horspool, R. Nigel. "Incremental generation of LR parsers." Computer Languages 15, no. 4 (January 1990): 205–23. http://dx.doi.org/10.1016/0096-0551(90)90021-g.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kanze, J. "Handling ambiguous tokens in LR-Parsers." ACM SIGPLAN Notices 24, no. 6 (June 1989): 49–54. http://dx.doi.org/10.1145/71052.71059.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Pezaris, S. D. "Shift-reduce conflicts in LR parsers." ACM SIGPLAN Notices 24, no. 11 (November 1989): 94–95. http://dx.doi.org/10.1145/71605.71611.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Corchuelo, Rafael, José A. Pérez,, Antonio Ruiz, and Miguel Toro. "Repairing syntax errors in LR parsers." ACM Transactions on Programming Languages and Systems 24, no. 6 (November 2002): 698–710. http://dx.doi.org/10.1145/586088.586092.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ancona, Massimo, Claudia Fassino, and Vittoria Gianuzzi. "Optimization of LR(k) “Reduced parsers”." Information Processing Letters 41, no. 1 (January 1992): 13–20. http://dx.doi.org/10.1016/0020-0190(92)90074-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "LR parsers"

1

Cerecke, Carl. "Locally least-cost error repair in LR parsers." Thesis, University of Canterbury. Computer Science, 2003. http://hdl.handle.net/10092/5492.

Full text
Abstract:
This thesis presents some methods for improving the efficiency and effectiveness of locally least-cost error repair algorithms for an LR-based parser. Three different algorithms for reducing the search space are described and compared using a collection of 59,643 incorrect Java programs collected from novice programmers. Two of the algorithms prove particularly effective at reducing the search space. Also presented is a more efficient priority queue implementation for storing transformations of the input string. The effect on repairs of different grammars describing the same language is investigated, and a comparison of different methods of assigning costs to edit operations is performed.
APA, Harvard, Vancouver, ISO, and other styles
2

Dain, Julia Anne. "Automatic error recovery for LR parsers in theory and practice." Thesis, University of Warwick, 1989. http://wrap.warwick.ac.uk/4162/.

Full text
Abstract:
This thesis argues the need for good syntax error handling schemes in language translation systems such as compilers, and for the automatic incorporation of such schemes into parser-generators. Syntax errors are studied in a theoretical framework and practical methods for handling syntax errors are presented. The theoretical framework consists of a model for syntax errors based on the concept of a minimum prefix-defined error correction,a sentence obtainable from an erroneous string by performing edit operations at prefix-defined (parser defined) errors. It is shown that for an arbitrary context-free language, it is undecidable whether a better than arbitrary choice of edit operations can be made at a prefix-defined error. For common programming languages,it is shown that minimum-distance errors and prefix-defined errors do not necessarily coincide, and that there exists an infinite number of programs that differ in a single symbol only; sets of equivalent insertions are exhibited. Two methods for syntax error recovery are, presented. The methods are language independent and suitable for automatic generation. The first method consists of two stages, local repair followed if necessary by phrase-level repair. The second method consists of a single stage in which a locally minimum-distance repair is computed. Both methods are developed for use in the practical LR parser-generator yacc, requiring no additional specifications from the user. A scheme for the automatic generation of diagnostic messages in terms of the source input is presented. Performance of the methods in practice is evaluated using a formal method based on minimum-distance and prefix-defined error correction. The methods compare favourably with existing methods for error recovery.
APA, Harvard, Vancouver, ISO, and other styles
3

Santos, Fred de Castro. "A mechanism to evaluate context-free queries inspired in LR(1) parsers over graph databases." PROGRAMA DE P?S-GRADUA??O EM SISTEMAS E COMPUTA??O, 2018. https://repositorio.ufrn.br/jspui/handle/123456789/24970.

Full text
Abstract:
Submitted by Automa??o e Estat?stica (sst@bczm.ufrn.br) on 2018-04-02T12:19:53Z No. of bitstreams: 1 FredDeCastroSantos_DISSERT.pdf: 1904530 bytes, checksum: 379e23c6c92c47609a52da136aeeb02e (MD5)
Approved for entry into archive by Arlan Eloi Leite Silva (eloihistoriador@yahoo.com.br) on 2018-04-04T12:11:32Z (GMT) No. of bitstreams: 1 FredDeCastroSantos_DISSERT.pdf: 1904530 bytes, checksum: 379e23c6c92c47609a52da136aeeb02e (MD5)
Made available in DSpace on 2018-04-04T12:11:32Z (GMT). No. of bitstreams: 1 FredDeCastroSantos_DISSERT.pdf: 1904530 bytes, checksum: 379e23c6c92c47609a52da136aeeb02e (MD5) Previous issue date: 2018-02-23
A World Wide Web ? uma cole??o de informa??es sempre crescente. Esta informa??o ? distribu?da entre documentos diferentes, disponibilizados atrav?s do HTTP. Mesmo que essa informa??o seja acess?vel aos usu?rios na forma de artigos de not?cias, transmiss?es de ?udio, imagens e v?deos, os agentes de software geralmente n?o podem classific?-la. A falta de informa??es sem?nticas sobre esses documentos em um formato leg?vel por m?quina geralmente faz com que a an?lise seja imprecisa. Um n?mero significativo de entidades adotaram Linked Data como uma forma de adicionar informa??es sem?nticas aos seus dados, e n?o apenas public?-lo na Web. O resultado ? uma cole??o global de dados, chamada Web of Data, que forma um grafo global, composto por declara??es no formato RDF [22] de diversas fontes, cobrindo todos os tipos de t?picos. Para encontrar informa??es espec?ficas nesses grafos, as consultas s?o realizadas come?ando em um sujeito e analisando seus predicados nas instru??es RDF. Esses predicados s?o as conex?es entre o sujeito e o objeto, e um conjunto de trilhas forma um caminho de informa??o. O uso de HTTP como mecanismo padr?o de acesso a dados e RDF como modelo de dados padr?o simplifica o acesso a dados, o que nos motiva a pesquisar alternativas na forma como esses dados s?o buscados. Uma vez que a maioria das linguagens de consulta de banco de dados de grafo est?o na classe de Linguagens Regulares, n?s propomos seguir um caminho diferente e tentar usar uma classe de gram?tica menos restritiva, chamada Gram?tica Livre de Contexto Determin?stica, para aumentar a expressividade das consultas no banco de dados em grafo. Mais especificamente, aplicando o m?todo de an?lise LR(1) para encontrar caminhos em um banco de dados de grafo RDF. O principal objetivo deste trabalho ? prover meios para se permitir a utiliza??o de t?cnicas de reconhecimento de gram?ticas livres de contexto LR(1) para fazer consultas por caminhos formados pelas etiquetas das arestas em um banco de dados RDF. Fornecendo, como um resultado, uma ferramenta que se permita atingir melhor expressividade, efici?ncia e escalabilidade nestas consultas do que o que existe atualmente. Para atingir este objetivo, n?s implementamos um algoritmo baseado nas t?cnicas de reconhecimento LR(1), usando o GSS [30] ao inv?s de uma pilha, e permitimos ao usu?rio fazer consultas com uma gram?tica livre de contexto (LR1). Tamb?m analisamos a complexidade do nosso algoritmo e executamos alguns experimentos, comparando nossa solu??o com as outras propostas na literatura, mostrando que a nossa pode ter melhor desempenho em alguns cen?rios.
The World Wide Web is an always increasing collection of information. This information is spread among different documents, which are made available by using the HTTP. Even though this information is accessible to users in the form of news articles, audio broadcasts, images and videos, software agents often cannot classify it. The lack of semantic information about these documents in a machine-readable format usually makes the analysis inaccurate. A significant number of entities have adopted Linked Data as a way to add semantic information to their data, not just publishing it on the Web. The result is a global data collection, called the Web of Data, which forms a global graph, consisting of RDF [22] statements from numerous sources, covering all sorts of topics. To find specific information in this graph, queries are performed starting at a subject and analyzing their predicates in the RDF statements. These predicates are the connections between the subject and object, and a set of traces forms an information path. The use of HTTP as a standardized data access mechanism and RDF as a standard data model simplifies the data access, but accessing heterogeneous data on distinct locations may have an increased time complexity and current query languages have a reduced query expressiveness, which motivates us to research alternatives in how this data is queried. This reduced expressiveness happens because most query languages belong to the class of Regular Languages. The main goal of this work is to use LR(1) context-free grammar processing techniques to search for context-free paths over RDF graph databases, providing, as result, a tool which allows better expressiveness, efficiency and scalability in such queries than what is proposed today. To achieve that, we implemented an algorithm based on the LR(1) parsing technique that uses the GSS [30] structure instead of a stack, and give means for the user to input queries with an LR(1) context-free grammar. Also, we analyze our algorithm?s complexity and make some experiments, comparing our solution to other proposals present in the literature and show that ours can have better performance in given scenarios.
APA, Harvard, Vancouver, ISO, and other styles
4

King, Laurie Anne Smith. "Code generation using a backtracking LR parser." W&M ScholarWorks, 1992. https://scholarworks.wm.edu/etd/1539623820.

Full text
Abstract:
Although the parsing phase of the modern compiler has been automated in a machine independent fashion, the diversity of computer architectures inhibits automating the code generation phase. During code generation, some intermediate representation of a source program is transformed into actual machine instructions. The need for portable compilers has driven research towards the automatic generation of code generators.;This research investigates the use of a backtracking LR parser that treats code generation as a series of tree transformations.
APA, Harvard, Vancouver, ISO, and other styles
5

Preußer, Thomas. "The wisent Parser Generator." Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-98686.

Full text
Abstract:
Objective: This document is not an introduction to parser generators. Readers should rather have a good understanding of them, especially of LALR parser generators. This document merely describes the main aspects of the implementation of a LALR parser generator named wisent. It is divided into a concise description of the programming interface and an overview over the data structures and specifics of the implementation of the wisent parser generator.
APA, Harvard, Vancouver, ISO, and other styles
6

Preußer, Thomas. "The wisent Parser Generator." Technische Universität Dresden, 2004. https://tud.qucosa.de/id/qucosa%3A26195.

Full text
Abstract:
Objective: This document is not an introduction to parser generators. Readers should rather have a good understanding of them, especially of LALR parser generators. This document merely describes the main aspects of the implementation of a LALR parser generator named wisent. It is divided into a concise description of the programming interface and an overview over the data structures and specifics of the implementation of the wisent parser generator.
APA, Harvard, Vancouver, ISO, and other styles
7

Kannapinn, Sönke. "Eine Rekonstruktion der LR-Theorie zur Elimination von Redundanz mit Anwendung auf den Bau von ELR-Parsern." [S.l.] : [s.n.], 2001. http://deposit.ddb.de/cgi-bin/dokserv?idn=962360651.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Konitzer, Marius [Verfasser], and Eberhard [Gutachter] Bertsch. "Laufzeitanalyse und Optimierung von Parsern für LR-reguläre Grammatiken / Marius Konitzer ; Gutachter: Eberhard Bertsch ; Fakultät für Mathematik." Bochum : Ruhr-Universität Bochum, 2013. http://d-nb.info/1230628592/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Minařík, Martin. "Strukturální metody identifikace objektů pro řízení průmyslového robotu." Doctoral thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2009. http://www.nusl.cz/ntk/nusl-233840.

Full text
Abstract:
This PhD thesis deals with the use of structural methods of objects identification for industrial robots operation. First, the present state of knowledge in the field is described, i.e. the whole process of objects recognition with the aid of common methods of the syntactic analysis. The main disadvantage of these methods is that is impossible to recognize objects whose digitalized image is corrupted in some ways (due to excessive noise or image disturbances), objects are therefore deformed. Further, other methods for the recognition of deformed objects are described. These methods use structural description of objects for object recognition, i.e. methods which determine the distance between attribute descriptions of images. The core part of this PhD thesis begins in Chapter 5, where deformation grammars, capable of description of all possible object deformations, are described. The only complication in the analysis is the ambiguity of the deformation grammar, which lowers the effectiveness of the analysis. Further, PhD thesis deals with the selection and modification of a proper parser, which is able to analyze a deformation grammar effectively. Three parsers are described: the modified Earley parser, the modified Tomita parser and the modified hybrid LRE(k) parser. As for the modified Earley’s parser, ways of its effective implementation are described. One of the necessary parts of the object recognition is providing the invariances, which this PhD thesis covers in detail, too. Finally, the results of described algorithms are mentioned (successfulness and speed of deformed objects recognition) and suggested testing environment and implemented algorithms are described. In conclusion, all determined possibilities of deformation grammars and their results are summarized.
APA, Harvard, Vancouver, ISO, and other styles
10

Le, Weijun Vivi. "The identification and elimination of redundant actions and states from noncanonical LR parsers." 1991. http://hdl.handle.net/1993/17352.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "LR parsers"

1

Dain, Julia Anne. Automatic error recovery for LR parsers in theory and practice. [s.l.]: typescript, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kirslis, Peter Andre Christopher. The SAGA editor: A language-oriented editor based on an incremental LR(1) parser. Urbana, Ill: Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "LR parsers"

1

Leermakers, René. "LR Parsers." In The Functional Treatment of Parsing, 115–42. Boston, MA: Springer US, 1993. http://dx.doi.org/10.1007/978-1-4615-3186-9_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Jourdan, Jacques-Henri, François Pottier, and Xavier Leroy. "Validating LR(1) Parsers." In Programming Languages and Systems, 397–416. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-28869-2_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Pfahler, Peter. "Optimizing directly executable LR parsers." In Lecture Notes in Computer Science, 179–92. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/3-540-53669-8_82.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Alonso, Miguel A., David Cabrero, and Manuel Vilares. "Construction of efficient generalized LR parsers." In Lecture Notes in Computer Science, 7–24. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0031377.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Blum, Norbert. "On LR(k)-Parsers of Polynomial Size." In Automata, Languages and Programming, 163–74. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14162-1_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

van den Brand, Mark G. J., Jeroen Scheerder, Jurgen J. Vinju, and Eelco Visser. "Disambiguation Filters for Scannerless Generalized LR Parsers." In Lecture Notes in Computer Science, 143–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45937-5_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

José, Fortes Gálvez. "Generating LR(1) parsers of small size." In Lecture Notes in Computer Science, 16–29. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-55984-1_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Sippu, Seppo, and Eljas Soisalon-Soininen. "Construction and Implementation of LR(1) Parsers." In Parsing Theory, 119–96. Berlin, Heidelberg: Springer Berlin Heidelberg, 1990. http://dx.doi.org/10.1007/978-3-662-08424-3_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Borsotti, Angelo, Luca Breveglieri, Stefano Crespi Reghizzi, and Angelo Morzenti. "Complexity of Extended vs. Classic LR Parsers." In Descriptional Complexity of Formal Systems, 77–89. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-09704-6_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Junek, Lukas, and Jiri Stastny. "Classification of Deformed Objects Using Advanced LR Parsers." In Recent Advances in Soft Computing and Cybernetics, 297–308. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-61659-5_25.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "LR parsers"

1

Nederhof, Mark-Jan, and Giorgio Satta. "An alternative method of training probabilistic LR parsers." In the 42nd Annual Meeting. Morristown, NJ, USA: Association for Computational Linguistics, 2004. http://dx.doi.org/10.3115/1218955.1219025.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Pottier, François. "Reachability and error diagnosis in LR(1) parsers." In CGO '16: 14th Annual IEEE/ACM International Symposium on Code Generation and Optimization. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2892208.2892224.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Baranowski, Artur, and Nico Hochgeschwender. "Grammar-Constrained Neural Semantic Parsing with LR Parsers." In Findings of the Association for Computational Linguistics: ACL-IJCNLP 2021. Stroudsburg, PA, USA: Association for Computational Linguistics, 2021. http://dx.doi.org/10.18653/v1/2021.findings-acl.108.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Srisuresh, Pyda, and Michael J. Eager. "A portable syntactic error recovery scheme for LR(1) parsers." In the 1985 ACM thirteenth annual conference. New York, New York, USA: ACM Press, 1985. http://dx.doi.org/10.1145/320599.320722.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kiyama, Masato, and Hyo Ashihara. "Syntax error repair with dynamic valid length in LR-based parsers." In 2008 International Conference on Control, Automation and Systems (ICCAS). IEEE, 2008. http://dx.doi.org/10.1109/iccas.2008.4694256.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Findley, W. Douglas, and V. Santhanam. "A practical algorithm for generating LR parsers maintaining immediate error detection (abstract)." In the 1986 ACM fourteenth annual conference. New York, New York, USA: ACM Press, 1986. http://dx.doi.org/10.1145/324634.325322.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Samuelsson, Christer. "Notes on LR parser design." In the 15th conference. Morristown, NJ, USA: Association for Computational Linguistics, 1994. http://dx.doi.org/10.3115/991886.991953.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bonev, Stoyan. "A flexible table driven LR(1) parser." In the 5th international conference. New York, New York, USA: ACM Press, 2004. http://dx.doi.org/10.1145/1050330.1050397.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Tomita, Masaru. "The generalized LR parser/compiler V8-4." In the 13th conference. Morristown, NJ, USA: Association for Computational Linguistics, 1990. http://dx.doi.org/10.3115/992507.992518.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Chen, Xin, and David Pager. "Full LR(1) parser generator Hyacc and study on the performance of LR(1) algorithms." In The Fourth International C* Conference. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/1992896.1992907.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'LR parsers' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography