No full-text available
To read the full-text of this research,
you can request a copy directly from the author.
Grammaticacontrole met behulp van Rscript
ResearchGate has not been able to resolve any citations for this publication.
The ASF+SDF Meta-Environment is an interactive language development environment whose main application areas are denition of domain-specic languages, generation of program analysis and transformation tools, production of software renovation tools, and general specication and prototyping. It uses conditional rewrite rules to dene the dynamic semantics and other tool-oriented aspects of languages, so the eectiveness of the generated tools is critically dependent on the quality of the rewrite rule implementation. The ASF+SDF rewrite rule compiler generates C code, thus taking advantage of C's portability and the sophisticated optimization capabilities of current C compilers as well as avoiding potential abstract machine interface bottlenecks. It can handle large (10 000+ rule) language denitions and uses an ecient run-time storage scheme capable of handling large (1 000 000+ node) terms. Term storage uses maximal subterm sharing (hash-consing), which turns out to be more eective i...
SDF is a formalism for the definition of syntax which is comparable to BNF in some respects, but has a wider scope in that it also covers the definition of lexical and abstract syntax. Its design and implementation are tailored towards the language designer who wants to develop new languages as well as implement existing ones in a highly interactive manner. It emphasizes compactness of syntax definitions by offering 1989 a standard interface between lexical and context-free syntax; (b) a standard correspondence between context-free and abstract syntax; (c) powerful disambiguation and list constructs; and (d) an efficient incremental implementation which accepts arbitrary context-free syntax definitions. SDF can be combined with a variety of programming and specification languages. In this way these obtain fully general user-definable syntax.
Syntactic and semantic analysis are established topics in the area of compiler construction. Their application to the understanding and restructuring of large software systems reveals, however that they have various shortcomings that need to be addressed. In this paper we study these shortcomings and propose several solutions. First, grammar recovery and grammar composition are discussed as well as the symbiosis of lexical syntax and context-free syntax. Next, it is shown how a relational calculus can be defined by way of term rewriting and how a fusion of term rewriting and this relational calculus can be obtained to provide semantics-directed querying and restructuring. Finally, we discuss how the distance between concrete syntax and abstract syntax can be minimized for the benefit of restructuring. In particular we pay attention to origin tracking, a systematic technique to maintain a mapping between the output and the input of the rewriting process. Along the way, opportunities for further research are indicated.
This is a duplicate publication. Someone (not an author, apparently) created a document with the title Draxving graphs vjith dot. Researchgate seems to have problems with quality control, and it appears there is no way to delete these corrupted entries.
This 320-page book treats parsing in its own right, in greater depth than is found in most computer science and linguistics books. It offers a clear, accessible, and thorough discussion of many different parsing techniques with their interrelations and applicabilities, including error recovery techniques. Unlike most books, it treats (almost) all parsing methods, not just the popular ones. See Preface + Introduction and/or Table of Contents for a quick impression. The book features a 48 page...
We present an algebraic specification for the static semantics of the process language ¯CRL. This specification can be executed in the ASF+SDF meta-environment which automatically derives a rewriting system for it. In this way, we immediately obtain a prototype of an enriched type checker (well-formedness checker) for ¯CRL. Our prototype is rather efficient and shows that automatic prototyping of formal specifications is feasible. Key Words & Phrases: Formal specification, Algebraic specification, Specification language, ¯CRL, Static semantics, Type checking, Asf+Sdf Partly supported by the European Communities under RACE project no. 2076, Broadband Object Oriented Service Technology (BOOST), and the Foundation for Computer Science in the Netherlands (SION) with financial support from the Netherlands Organization for Scientific Research (NWO). 2 CONTENTS Contents 1 Introduction 3 2 The Asf+Sdf Meta-environment 4 3 ¯CRL 4 3.1 Syntax : : : : : : : : : : : : : : : : : : : : : : : ...
Over the last few years, several formal specifications for the static semantics of Pascal have been published. Thus far, however, no algebraic specification has been given. In this document we discuss an algebraic specification we have made for the complete static semantics of Pascal as defined by the International Standardization Organization (ISO). We explain how the specification has been set up, and how several details have been dealt with in a convenient way. Finally, we relate the specification to algebraic specifications for other aspects of (other) programming languages, and we briefly compare the algebraic approach with the other formal specifications for Pascal. Key Words & Phrases: Formal specifications, algebraic specifications, Pascal, programming language semantics, static semantics, type checking. 1991 CR Categories: D.2.1 [Software engineering]: Requirements/specifications - Languages D.3.1 [Programming languages]: Formal definitions and theory - syntax, semantics F.3....
ClearParse SDK Programmer's Guide, 2003. ClearParseSDK.pdf
- Clearjump
ClearJump. ClearParse SDK Programmer's Guide, 2003.
ClearParseSDK.pdf.
- T Parr
T. Parr et al.
ANTLR Reference Manual, 2003.
http://www.antlr.org/doc/index.html.
extract-facts(definition $Definition) = $Rstore2 [edss-1] extract-declared-symbols($Sort, $Elems) = $Elems
- M G J Van Den Brand
- H A Jong
- P Klint
- P A Olivier
M.G.J. van den Brand, H.A. de Jong, P. Klint, and P.A.
Olivier. Efficient annotated terms. Software, Practice and
Experience, 30(3):259-291, 2000.
extract-facts(definition $Definition) = $Rstore2
[edss-1] extract-declared-symbols($Sort, $Elems) =
$Elems, <get-location($Sort), symbol2str($Sort)>