234 Hits in 5.0 sec

An experimental ambiguity detection tool

Sylvain Schmitz
2010 Science of Computer Programming  
A generalized parser parses correctly the corresponding Standard ML programs, but might return more than one parse (Section 2.3). • We detail how our tool identifies the ambiguity as such and discards  ...  We present an experimental ambiguity detection tool for GNU Bison, and illustrate how it can assist a grammatical development for a subset of Standard ML. • We first describe a well-known difficult subset  ...  The author also thanks Jacques Farré for his help in the preparation of this paper and Sébastien Verel for granting him access to a fast computer.  ... 
doi:10.1016/j.scico.2009.07.002 fatcat:gakswharzrgzvi3y7i5zbmd3jy

Page 2776 of Mathematical Reviews Vol. , Issue 2002D [page]

2002 Mathematical Reviews  
; Meguro) Yet another generation of LALR parsers for regular right part grammars.  ...  Summary: “In this paper we introduce two methods for building LALR parsers for regular right part grammars (RRPGs).  ... 

An Experimental Ambiguity Detection Tool

Sylvain Schmitz
2008 Electronical Notes in Theoretical Computer Science  
We present an experimental ambiguity detection tool for GNU/bison, and illustrate how it can assist a grammatical development for a subset of Standard ML.  ...  Although programs convey an unambiguous meaning, the grammars used in practice to describe their syntax are often ambiguous, and completed with disambiguation rules.  ...  Acknowledgement The author is highly grateful to Jacques Farré for his help in the preparation of this paper, to Sébastien Verel for granting him the access to a fast computer, and to the anonymous referees  ... 
doi:10.1016/j.entcs.2008.03.045 fatcat:nioedkjmy5ctzcrxyzcm4pqcmm

Page 8090 of Mathematical Reviews Vol. , Issue 98M [page]

1998 Mathematical Reviews  
Havel (Prague) 98m:68165 68Q52 Morimoto, Shin-ichi Yet another generation of LALR parsers for regular right part grammars. (Japanese. English and Japanese summaries) Trans. Inform. Process. Soc.  ...  Summary: “A simple method for building LALR parsers for reg- ular right part grammars is given. No grammar transformation is required. No extra data structures such as counters are required.  ... 

Lazy and incremental program generation

J. Heering, P. Klint, J. Rekers
1994 ACM Transactions on Programming Languages and Systems  
Lazy and incremental program generation Heering, J.; Klint, P.; Rekers, J.  ...  G would be a parser generator, and G. would be a parser for a specific grammar a. Compilation of a programming language L is another instructive example.  ...  As is to be expected, it has a less efficient generation phase than IPG, but generates better parsers for LALR(l) grammars that are not LR(0).  ... 
doi:10.1145/177492.177750 fatcat:waozsk4bwvfkdg5tfq3jhpc6ce

Bounded-connect noncanonical discriminating-reverse parsers

Jacques Farré, J. Fortes Gálvez
2004 Theoretical Computer Science  
The precision of right-hand context covering for con ict resolution is improved over previous NDR parsers, resulting in acceptation of wider subsets of LR-regular and LR-nonregular grammars, including  ...  all LALR(k) grammars for a given k.  ...  Thus BC(h)DR(0) accepts any grammar the above parsers for subsets of LRR accept, for h¿2(k − 1), and also grammars that any (ideal) LRR parser generator would reject.  ... 
doi:10.1016/j.tcs.2003.10.006 fatcat:bgmmi27gmrffleeojfs7mukegq

A Drop-in Replacement for LR(1) Table-Driven Parsing

Michael Oudshoorn
2021 Advances in Computing and Engineering  
This is achieved by replacing the deterministic push down automata of LR parsing by a two-stack automata. The class of grammars accepted by the two-stack parser properly contains the LR(k) grammars.  ...  This effectively relaxes the requirement of parsing the reverse of the right-most derivation of a string/sentence.  ...  The parser generator described below is more general than the LR(1) algorithm and more practical than for the deterministic regular parsable (DRP) grammars [8].  ... 
doi:10.21622/ace.2021.01.2.047 fatcat:md53ji3xlzauvgvos4pkfez2xa

Extending lookahead for LR parsers

Theodore P. Baker
1981 Journal of computer and system sciences (Print)  
Since it is based on a state transition graph. rather than a grammar, there should not even be any difficulty applying the construction to LR parsers obtained from regular right-part grammars [ 111, or  ...  For k > 1, this relationship does not extend. Clearly, the XLR(k) grammars are always a subset of the LALR(k) grammars.  ...  A recent paper by DeRemer [6] on efficient algorithms for computing LALR(1) lookahead sets makes use of state relationships very similar to those behind the XLR construction.  ... 
doi:10.1016/0022-0000(81)90030-1 fatcat:er67vowxo5cqjnshmqpayne7fy

Elkhound: A Fast, Practical GLR Parser Generator [chapter]

Scott McPeak, George C. Necula
2004 Lecture Notes in Computer Science  
The Generalized LR (GLR) parsing algorithm is attractive for use in parsing programming languages because it is asymptotically efficient for typical grammars, and can parse with any context-free grammar  ...  These ideas are implemented in the Elkhound GLR parser generator.  ...  Introduction The state of the practice in automated parsing has changed little since the introduction of YACC (Yet Another Compiler-Compiler), an LALR(1) parser generator, in 1975 [1] .  ... 
doi:10.1007/978-3-540-24723-4_6 fatcat:oausmbrqnzb2diwure5zshie4y

Pure and declarative syntax definition

Lennart C.L. Kats, Eelco Visser, Guido Wachsmuth
2010 Proceedings of the ACM international conference on Object oriented programming systems languages and applications - OOPSLA '10  
Mainstream parser generators pose restrictions on syntax definitions that follow from their implementation algorithm.  ...  We analyze how these problems arise for different aspects of syntax definitions, discuss their consequences for language engineers, and show how the pure and declarative nature of syntax definitions can  ...  Acknowledgements We thank Glenn Vanderburg and the anonymous referees for providing valuable feedback to improve the presentation of this paper.  ... 
doi:10.1145/1869459.1869535 dblp:conf/oopsla/KatsVW10 fatcat:7aw33mllmjakpgf3bjgopblwty

Declarative, formal, and extensible syntax definition for aspectJ

Martin Bravenboer, Éric Tanter, Eelco Visser
2006 SIGPLAN notices  
, generalized-LR parser (SGLR).  ...  Finally, benchmarks show the reasonable performance of scannerless generalized-LR parsing for this grammar.  ...  We thank Rob Vermaas for his help with the implementation of the syntax definition and benchmarking the generated parser.  ... 
doi:10.1145/1167515.1167491 fatcat:v5xwnic44jdchoqoafscrdgjfu

A Scanner and Parser for Z Specifications

Maria Ulfah Siregar, John Derrick
2018 IJID (International Journal on Informatics for Development)  
These tools generate several Java files which can be integrated with a main program in Java. Our research could produce a scanner and parser for Z specifications.  ...  This paper describes our research on implementing a scanner and parsers for Z specifications. Rather to code them from scratch, we use tools that have specialities on creating such tasks.  ...  For example: the LALR parser generator Construction of Useful Parsers (CUP) by Scott Hudson, the Java modification of Berkeley Yet Another Compiler Compiler (YACC), BYACC/J, by Bob Jamison [2] .  ... 
doi:10.14421/ijid.2018.07104 fatcat:li3tqbjslndzndkz55uqnvkqey

Disambiguation Filters for Scannerless Generalized LR Parsers [chapter]

Mark G. J. van den Brand, Jeroen Scheerder, Jurgen J. Vinju, Eelco Visser
2002 Lecture Notes in Computer Science  
Ambiguities that arise through the use of unrestricted grammars are handled by explicit disambiguation constructs, instead of implicit defaults that are taken by traditional scanner and parser generators  ...  Depending on the kind of disambiguation, filters can be applied at parser generation time, at parse time, or after parsing.  ...  Merijn de Jonge and Joost Visser were instrumental in the development of the Online Grammar Base that serves both as a testbed for SGLR and as standardization tool for syntax definitions.  ... 
doi:10.1007/3-540-45937-5_12 fatcat:vaexoipvy5ffldxi62glxdfbge

Static Validation of Dynamically Generated HTML Documents Based on Abstract Parsing and Semantic Processing [chapter]

Hyunha Kim, Kyung-Goo Doh, David A. Schmidt
2013 Lecture Notes in Computer Science  
We completely define the HTML 4.01 Transitional DTD in an attributed LALR(1) grammar, carry out experiments for selected real-world JSP and PHP applications, and expose numerous HTML validation errors  ...  parsing is a static-analysis technique for a program that, given a reference LR(k) context-free grammar, statically checks whether or not every dynamically generated string output by the program conforms  ...  We thank anonymous referees for valuable suggestions and comments.  ... 
doi:10.1007/978-3-642-38856-9_12 fatcat:mwqho7ntgbcjfbf2ndykhg7avq

On LR Parsing with Selective Delays [chapter]

Eberhard Bertsch, Mark-Jan Nederhof, Sylvain Schmitz
2013 Lecture Notes in Computer Science  
We provide two characterizations for the resulting class of grammars, one based on grammar transformations, the other on the direct construction of a parser.  ...  We also report on experiments with a grammar collection.  ...  In Section 2.2, we provide yet another view on uniform ML(k, m) grammars, before motivating the use of selective delays in Section 2.3.  ... 
doi:10.1007/978-3-642-37051-9_13 fatcat:2cfavzenwvh7zmsaotcwke32ru
« Previous Showing results 1 — 15 out of 234 results