… Grammar testing is discussed in the context of grammar engineering (i.e., software engineering for grammars). We propose a gen- eralisation of the known rule coverage for grammars, that is, context-dependent branch coverage. We investigate …
FASE 2001: 201-216 [doi]… We employ transformations for the adaptation of grammars. Grammars need to be adapted in grammar development, grammar maintenance, grammar reengineering, and grammar recovery. Starting from a few fundamental transformation primitives …
FM 2001: 550-570 [doi]… Grammars, especially context-free grammars, are widely used within and even … framework for grammar testing, in which some commonly used techniques for testing … to the testing of grammars. We propose a nonterminal-based approach for grammar …
ACISicis 2009: 1013-1019 [doi]… fragments of context-free grammars. Usually this concerns expression grammars … grammar only, but using auxiliary non-terminals and extra chain productions resulting in a grammar that generates different and larger trees and extra parse steps …
Technical Report P9717, 1997.… Grammar convergence is a lightweight verification method for establishing and maintaining the correspondence between grammar knowledge ingrained in all kinds …, or language documents. The central idea is to extract grammars from diverse …
IFM 2009: 246-260 [doi]… MediaWiki grammars. Over two hundred grammar transformation steps are reported and annotated, leading to delivery of a level 2 grammar, semi-automatically extracted … in grammars that were not engineered properly. Having a quality grammar …
CoRR, abs/1107.4661:1-47, July 2011.… A grammar-based approach to tool development in re- and reverse engineering …. Firstly, it is a considerable up-front investment to obtain a grammar for a relevant language or cocktail of languages. Existing work on grammar recovery addresses …
ICSM 2003: 179 [doi]… engineering techniques can be applied to the development of a grammar. The employed development methodology can be described as iterative grammar engineering and includes the application of techniques such as grammar metrics, unit testing, and test …
SLE 2008: 285-304 [doi]… Grammars for programming languages are traditionally specified statically … expression grammars and packrat parsers to model grammars and parsers as objects … that dynamic grammars are not only flexible but highly practical. …
In 4th Workshop on Dynamic Languages and Applications (DYLA 2010). 2010:… Grammar convergence is a method that helps discovering relationships between different grammars of the same language or different language versions. The key … of those relationships. Given input grammars for convergence, they are transformed …
corr, abs/1008.4188:1-46, August 2010.… Grammar convergence is a method that helps in discovering relationships between different grammars of the same language or different language versions. The key … of those relationships. Given input grammars for convergence …
sqj, 19(2):333-378, March 2011. [doi]… grammars. Some ambiguity is intentional while other ambiguity is accidental. A good grammar development environment should therefore contain a static ambiguity checker to help the grammar engineer. Ambiguity of context-free grammars …
LDTA 2010: 5 [doi]… the grammars that occur in the different versions of the Java Language Specification (JLS). The relationships are represented as grammar transformations that capture all accidental or intended differences between the JLS grammars …
SCAM 2009: 178-186 [doi]… Context-free grammars are the most suitable and most widely used method … processing or analysis of the source text. In this sense, grammars form the basis …, context-free grammars have the undesirable property that they can be ambiguous, which …
PhD thesis, Universiteit van Amsterdam, December 2011.… An extension to canonical attribute grammars is introduced, permitting attributes to be references to arbitrary nodes in the syntax tree, and attributes … in these grammars, and an optimal evaluation algorithm is available. The proposed …
informaticaSI, 24(3):301-317, 2000.… An extension to attribute grammars is introduced which allows objects and references to be specified as part of a syntax tree attribution. Practical advantages of these grammars include a simpler specification of many problems in static …
cc 1994: 31-51… fuzzing of complex structured-input applications with a grammar-based specification … symbolic execution directly generates grammar-based constraints whose satisfiability is checked using a custom grammar-based constraint solver. We have …
PLDI 2008: 206-215 [doi]… Attribute grammars are a powerful specification paradigm for many language … attribute grammar systems use dynamic scheduling algorithms to evaluate attributes … programming language. The result is a small, lightweight attribute grammar library …
SCP, 78(10):1752-1769, 2013. [doi]… Methods of describing the syntax of programming languages in ways that are more flexible and natural than conventional BNF descriptions are considered. These methods involve the use of ambiguous context-free grammars together with rules …
CACM, 18(8):441-452, 1975. [doi]… for such syntax-driven meta-tooling in which grammars serve as contracts between …
gcse 2001: 85-99 [doi]