Download PDFOpen PDF in browserTranslating C# to Branching Symbolic Transducers14 pages•Published: June 4, 2017AbstractThe paper looks at tooling aspects of transforming C# programs into symbolic transducers with branching rules (BSTs). The latter are used for describing list comprehensions that incorporate loop-carried state. One concrete application is log analysis where input streams of data are transformed into output streams of data via intermediate pipelines of transducers. The paper presents algorithms for translating C# to BSTs, and for exposing control state in BSTs.Keyphrases: automata theory, domain specific language, symbolic transducer In: Thomas Eiter, David Sands, Geoff Sutcliffe and Andrei Voronkov (editors). IWIL Workshop and LPAR Short Presentations, vol 1, pages 86-99.
|