Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Total parser combinators
A monadic parser combinator library which guarantees termination of parsing, while still
allowing many forms of left recursion, is described. The library's interface is similar to those …
allowing many forms of left recursion, is described. The library's interface is similar to those …
Functional programming with structured graphs
This paper presents a new functional programming model for graph structures called
structured graphs. Structured graphs extend conventional algebraic datatypes with explicit …
structured graphs. Structured graphs extend conventional algebraic datatypes with explicit …
An exploration of left-corner transformations
The left-corner transformation (Rosenkrantz and Lewis, 1970) is used to remove left
recursion from context-free grammars, which is an important step towards making the …
recursion from context-free grammars, which is an important step towards making the …
Embedding invertible languages with binders: a case of the FliPpr language
This paper describes a new embedding technique of invertible programming languages,
through the case of the FliPpr language. Embedded languages have the advantage of …
through the case of the FliPpr language. Embedded languages have the advantage of …
Generic programming of all kinds
Datatype-generic programming is a widely used technique to define functions that work
regularly over a class of datatypes. Examples include deriving serialization of data, equality …
regularly over a class of datatypes. Examples include deriving serialization of data, equality …
A new method for dependent parsing
T Jim, Y Mandelbaum - … and Systems: 20th European Symposium on …, 2011 - Springer
Dependent grammars extend context-free grammars by allowing semantic values to be
bound to variables and used to constrain parsing. Dependent grammars can cleanly specify …
bound to variables and used to constrain parsing. Dependent grammars can cleanly specify …
Abstract syntax graphs for domain specific languages
This paper presents a representation for embedded domain specific languages (EDSLs)
using abstract syntax graphs (ASGs). The purpose of this representation is to deal with the …
using abstract syntax graphs (ASGs). The purpose of this representation is to deal with the …
Dependently typed grammars
Parser combinators are a popular tool for designing parsers in functional programming
languages. If such combinators generate an abstract representation of the grammar as an …
languages. If such combinators generate an abstract representation of the grammar as an …
[HTML][HTML] Attribute grammar macros
Having extensible languages is appealing, but raises the question of how to construct
extensible compilers and how to compose compilers out of a collection of pre-compiled …
extensible compilers and how to compose compilers out of a collection of pre-compiled …
First class syntax, semantics, and their composition
Ideally complexity is managed by composing a system out of quite a few, more or less
independent, and much smaller descriptions of various aspects of the overall artefact. When …
independent, and much smaller descriptions of various aspects of the overall artefact. When …