Logo des Repositoriums

Auflistung nach Autor:in "Lepper, Markus"

1 - 3 von 3
  • Konferenzbeitrag
    D2d - Kreatives Schreiben von XML-codierten Texten
    (Informatik 2016, 2016) Lepper, Markus; Widemann, Baltasar Trancón Y.
  • Konferenzbeitrag
    Module Parametrization By Rewriting: Theory underlying our tutorial “D2d — valide aber lesbar”
    (INFORMATIK 2024, 2024) Lepper, Markus; Trancón, Baltasar
    With modular architectures of source text objects, which organize re-usable complex definitions in libraries of importable modules, a method of free rewriting can be more adequate than pre-wired parameters: Each module import can be accompanied with a set of rewriting rules, mapping references to expressions and thus adapting the imported definitions to the needs of the importer. Such a mechanism is described in this paper; it has been implemented in the d2d system applied to document types. It can easily be transferred to other formalisms for document types definition, and appears applicable also to other architectures with a 'glass box' view to modules. There are two fundamentally different use cases: rewriting (a) to algebraic semantics, e.g., for controlling a parsing process, and (b) reifying the rewritten results, for documentation, statistics, automated user dialogue, etc. The second case needs much more effort than the first. For both cases, an algorithm is presented, which is designed for optimized performance, and which reflects details arising from experiences in practical applications. The transfer to other languages is supported by a division of the second algorithm into a generic and a specific part.
  • Konferenzbeitrag
    Paisley: A pattern matching library for arbitrary object models
    (Software Engineering 2013 - Workshopband, 2013) Trancón y Widemann, Baltasar; Lepper, Markus
    Professional development of software dealing with structured models requires more systematic approach and semantic foundation than standard practice in general-purpose programming languages affords. One remedy is to integrate techniques from other programming paradigms, as seamless as possible and without forcing programmers to leave their comfort zone. Here we present a tool for the implementation of pattern matching as fundamental means of automated data extraction from models of arbitrary shape and complexity in a general-purpose programming language. The interface is simple but, thanks to elaborate and rigorous design, is also light-weight, portable, non-invasive, type-safe, modular and extensible. It is compatible with object-oriented data abstraction and has full support for nondeterminism by backtracking. The tool comes as a library consisting of two levels: elementary pattern algebra (generic, highly reusable) and pattern bindings for particular data models (specific, fairly reusable, user-definable). Applications use the library code in a small number of idiomatic ways, making pattern-matching code declarative in style, easily writable, readable and maintainable. Library and idiom together form a tightly embedded domain-specific language; no extension of the host language is required. The current implementation is in Java, but assumes only standard object-oriented features, and can hence be ported to other mainstream languages.