Pure and declarative syntax definition

TL;DR: The main contribution of the paper is that it breaks classic boundaries between models and programs because formal binding of metalevels and base level have been reached.

TL;DR: The total run-time of ambiguity detection for character-level grammars for languages such as C and Java is significantly reduced, without loss of precision, and the result is that efficient ambiguity detection in realistic Grammars is possible and may therefore become a tool in language workbenches.

TL;DR: This paper presents a parser generator which accepts as input a grammar in SDF format, and produces a parser ready to be integrated with K, and illustrates the methodology of defining a language using the generated parser based on an example.

TL;DR: This work proposes a rigorous methodology to create GUI (Graphical User Interface) based DSLs formal tools, aimed at providing a productive and trustworthy development methodology to safety critical industries.

TL;DR: A parsing algorithm which seems to be the most efficient general context-free algorithm known is described, similar to both Knuth's LR(k) algorithm and the familiar top-down algorithm.

TL;DR: LR(k) grammars are defined, which are perhaps the most general ones of this type, and they provide the basis for understanding all of the special tricks which have been used in the construction of parsing algorithms for languages with simple structure, e.g. algebraic languages.

TL;DR: The abstract data type of Annotated Terms (ATerms) is introduced, and their design, implementation and application are discussed.

TL;DR: Backus has developed an elegant method of defining well-formed formulas for computer languages such as ALGOL that consists of a finite sequence of letters from the alphabet.