Mark G. J. van den Brand, Jeroen Scheerder, Jurgen Vinju, and Eelco Visser. Disambiguation filters for scannerless generalized LR parsers. In Compiler Construction: 11th International Conference (CC'02), volume 2304 of Lecture Notes in Computer Science, pages 143--158, Grenoble, France, April 2002. 15  Home/Search   Document Details and Download   Summary   Related Articles   Check

..... ExtendsOpt : extends Identifier ; which is also less susceptible to extension; there is no nonterminal where, for instance, a concept of anonymous classes with a class . syntax may subsequently be added. In contrast, Earley s algorithm [6] and generalized LR(k) parsing [10] allow any grammar, but sacrifice linear time processing. Also, they ignore ambiguities by constructing all parse trees, and choosing the right one at the end requires non local reasoning. Our goal is to obtain an e#cient parsing algorithm that allows productions to be added incrementally and ....

M. G. J. van den Brand, J. Scheerder, J. J. Vinju, and E. Visser. Disambiguation filters for scannerless generalized lr parsers. In Proc. Compiler Construction 2002.

....do not encounter the required input. This method has been validated in practice but research questions remain: Since the complete class of context free languages can be recognized, also ambiguous sentences can be recognized. The filtering of undesired ambiguities is an area of ongoing research [11]. In the case of a syntactically incorrect input sentence, more than one parse may have been tried. This makes it hard to give precise error messages pointing at the precise location of and reason for the error. The parameterization of modular grammars needs further study. 2.3. Lexical ....

M. G. J. van den Brand, J. Scheerder, J. Vinju, and E. Visser. Disambiguation filters for scannerless generalized LR parsers. In N. Horspool, editor, Compiler Construction (CC'02), Lecture Notes in Computer Science. Springer-Verlag, 2002.

....formulated in (extended) BNF are generally regarded as appropriate for describing context free syntax, and are well supported by parser generators. Most of them, however, restrict grammars to be LALR or LL, and this seriously undermines modularity; a notable exception is SGLR parser generation [6], which allows the use of arbitrary context free grammars. In connection with semantic descriptions, there is less agreement about which formalism to use. Many would advocate attribute grammars for static semantics, and in fact the Eli system supports generation of static analyzers from attribute ....

M. G. J. van den Brand, J. Scheerder, J. J. Vinju, and E. Visser. Disambiguation filters for scannerless generalized LR parsers. In R. N. Horspool, editor, Compiler Construction (CC'02), volume 2304 of LNCS, pages 143--158. Springer-Verlag, 2002.

....than merely one result per cell as a packrat parser does, leading to the super linear parse time of Earley s algorithm. SDF, a practical parser generation system, uses generalized CFG parsing based on Tomita s Generalized LR (GLR) algorithm to support parsing with integrated lexical analysis [25, 24]. Due to the limited expressiveness of pure CFG notation, SDF provides extensions allowing useful disambiguation rules of various kinds to be declared. The parser uses these disambiguation rules to trim the set of alternative parse trees produced by the parser both during and after the parsing ....

M.G.J. van den Brand, J. Scheerder, J.J. Vinju, and E. Visser. Disambiguation filters for scannerless generalized LR parsers. In Compiler Construction, 2002.

....parsing with respect to NSLR(1) is unclear: packrat parsing is less restrictive of rightward lookahead, but NSLR(1) can also take leftward context into account. In practice, NSLR(1) is probably more space efficient, but packrat parsing is simpler and cleaner. Other recent scannerless parsers [22, 21] forsake linear time deterministic algorithms in favor of more general but slower ambiguity tolerant CFG parsing. 8 Future Work While the results presented here demonstrate the power and practicality of packrat parsing, more experimentation is needed to evaluate its flexibility, performance, and ....

M.G.J. van den Brand, J. Scheerder, J.J. Vinju, and E. Visser. Disambiguation filters for scannerless generalized LR parsers. In Compiler Construction, 2002.

No context found.

M. G. J. van den Brand, J. Scheerder, J. Vinju, and E. Visser. Disambiguation filters for scannerless generalized LR parsers. In N. Horspool, editor, Compiler Construction (CC'02), volume 2304 of Lecture Notes in Computer Science, pages 143--158, Grenoble, France, April 2002. Springer-Verlag.

....this kind of language extension. Since only the full class of context free grammars, and not any of its subclasses such as LL or LR, are closed under composition, modularity of syntax definitions requires support from a generalized parsing technique. SDF2 employs scannerless generalized LR parsing [20,8]. The syntax definitions for two languages may partially overlap, e.g. define the same sorts. SDF2 supports renaming of sorts to avoid name clashes and ambiguities resulting from them. In Figure 4 several sorts from the Stratego syntax definition (Id, Var, and StrChar) are renamed since the ....

....declarations. Figure 5 declares syntax schemata for meta variables. According to this declaration x, y, and g10 are meta variables for identifiers and e, e1, and e1023 are meta variables of sort Exp. The prefer attribute ensures that these identifiers are preferred over normal Tiger identifiers [8]. 3.3 Meta Explode Parsing a module according to the combined syntax and mapping the parse tree to abstract syntax results in an abstract syntax tree that contains a mixture of meta and object language abstract syntax. Since the meta language compiler only deals with meta language abstract ....

[Article contains additional citation context not shown here]

M. G. J. van den Brand, J. Scheerder, J. Vinju, and E. Visser. Disambiguation filters for scannerless generalized LR parsers. In N. Horspool, editor, Compiler Construction (CC'02), volume 2304 of Lecture Notes in Computer Science, pages 143--158, Grenoble, France, April 2002. Springer-Verlag.

....environment to develop these language definitions and to generate a programming environment given a language definition. Three technical developments of ASF SDF proved to be very useful for the development of an ELAN environment, namely ATerms [5] ToolBus [1] and the generic parsing technology [7]. The ATerms format is a generic formalism for the representation of structured information, like (abstract) syntax tree, parse tables, environments, etc. The ToolBus is a software coordination architecture, which module BasicStrategies[Sort] exports context free syntax id Sort ....

..... repeat (Sort) Sort builtin( repeat ) Fig. 1. Primitive strategy operators takes care of the coordination of software components. The generic parsing technology consists of a parse table generator and a parser. The parser is a scannerless generalized LR parser (SGLR) [7]. 2 ELAN4.0 The design of this new ELAN environment has also led to a complete redesign of the ELAN formalism itself. The syntax of this new ELAN version has completely changed. The syntax modifications can be summarized as follows: The signature definition is replaced by SDF. The ELAN ....

M.G.J. van den Brand, J. Scheerder, J.J. Vinju, and E. Visser. Disambiguation Filters for Scannerless Generalized LR Parsers. In N. Horspool, editor, Compiler Construction (CC'02), volume ?? of Lecture Notes in Computer Science, pages ??--?? Springer-Verlag, 2002.

....input. From this grammar, it generates a class hierarchy to represent the parse trees corresponding to the grammar, the hierarchy specific Visitor and Visitable interfaces, and the Fwd combinator. In addition to framework instantiation, JJForester provides connectivity to a generalized LR parser [2]. Operations After instantiation, the application programmer can implement operations on the class hierarchy by specializing, composing, and applying visitors. The starting point of hierarchy specific visitors is Fwd. Typical default visitors provided to Fwd are Identity and Fail. Furthermore, ....

M. G. J. van den Brand, J. Scheerder, J. Vinju, and E. Visser. Disambiguation filters for scannerless generalized LR parsers. In N. Horspool, editor, Compiler Construction (CC'02), Lecture Notes in Computer Science. Springer-Verlag, 2002.

No context found.

Mark G. J. van den Brand, Jeroen Scheerder, Jurgen Vinju, and Eelco Visser. Disambiguation filters for scannerless generalized LR parsers. In Compiler Construction: 11th International Conference (CC'02), volume 2304 of Lecture Notes in Computer Science, pages 143--158, Grenoble, France, April 2002. 15

No context found.

M. van den Brand, J. Scheerder, J.J. Vinju and E. Visser, "Disambiguation Filters for Scannerless Generalized LR Parsers", Proc. 11th International Conference on Compiler Construction, 143--158 (2002).

No context found.

van den Brand, M. G. J., J. Scheerder, J. J. Vinju and E. Visser, Disambiguation filters for scannerless generalized lr parsers, in: CC '02: Proceedings of the 11th International Conference on Compiler Construction (2002), pp. 143--158.

No context found.

M.G.J. van den Brand, J. Scheerder, J.J. Vinju, and E. Visser. Disambiguation filters for scannerless generalized LR parsers. In Compiler Construction, 2002.

No context found.

M. G. J. van den Brand, J. Scheerder, J. Vinju, and E. Visser. Disambiguation filters for scannerless generalized LR parsers. In Compiler Construction (CC'02), Lecture Notes in Computer Science. Springer-Verlag, 2002.

No context found.

M.G.J. van den Brand, J. Scheerder, J.J. Vinju, and E. Visser. Disambiguation filters for scannerless generalized LR parsers. In Compiler Construction, 2002.

No context found.

M. van den Brand, J. Scheerder, J. Vinju, and E. Visser. "Disambiguation Filters for Scannerless Generalized LR Parsers". In Compiler Construction, LNCS 2304, pp. 143--158. Springer, 2002.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC