Exploration of language specifications by compilation to first-order logic

Grewe, Sylvia; Erdweg, Sebastian; Pacak, André; Raulf, Michael; Mezini, Mira

doi:10.1016/j.scico.2017.08.001

Cited by 3 publications

(2 citation statements)

References 25 publications

(49 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Grewe et al [5] discuss the exploration of language specifications with first-order theorem provers. However, they still require the reader to be able to intuitively translate language specifications to a sufficiently formal language first.…”

Section: Hole Fillingmentioning

confidence: 99%

“…We introduce the following convention: We define meta-level parentheses to be those parentheses which surround a single object and which may optionally be omitted from some arrangements with a similar form. 5 It is still cumbersome to write [ • ] ≈ in so many places. One of the ways we deal with this is to arrange for this to happen automatically at places where a piece of meta-level syntax requires an arrangement to be regarded as an object.…”

Section: Syntax Shorthand: Arrangement Coercionsmentioning

confidence: 99%

See 1 more Smart Citation

What Does This Notation Mean Anyway? BNF-style notation as it is actually used

Feller¹,

Wells²,

Carlier³

et al. 2018

EasyChair Preprints

View full text Add to dashboard Cite

Following the introduction of BNF notation by Backus for the Algol 60 report and subsequent notational variants, a metalanguage involving formal “grammars” has developed for discussing structured objects in Computer Science and Mathematical Logic. We refer to this offspring of BNF as Math-BNF or MBNF, to the original BNF and its notational variants just as BNF, and to aspects common to both as BNF-style. MBNF is sometimes called abstract syntax, but we avoid that name because MBNF is in fact a concrete form and has a more abstract form. What all BNF-style notations share is the use of production rules roughly of this form: ◯ ⩴ □₁ | ⋯ | □ₙ Normally, such a rule says “every instance of □ᵢ for i ∈ {1, ..., n} is also an instance of ◯”.MBNF is distinct from BNF in the entities and operations it allows. Instead of strings, MBNF builds arrangements of symbols that we call math-text. Sometimes “syntax” is defined by interleaving MBNF production rules and other mathematical definitions that can contain chunks of math-text.There is no clear definition of MBNF. Readers do not have a document which tells them how MBNF is to be read and must learn MBNF through a process of cultural initiation. To the extent that MBNF is defined, it is largely through examples scattered throughout the literature.This paper gives MBNF examples illustrating some of the differences between MBNF and BNF. We propose a definition of syntactic math text (SMT) which handles many (but far from all) uses of math-text and MBNF in the wild. We aim to balance the goal of being accessible and not requiring too much prerequisite knowledge with the conflicting goal of providing a rich mathematical structure that already supports many uses and has possibilities to be extended to support more challenging cases.

show abstract

Section: Hole Fillingmentioning

confidence: 99%

Section: Syntax Shorthand: Arrangement Coercionsmentioning

confidence: 99%