Van Wijngaarden grammars
E440604
Van Wijngaarden grammars are a highly expressive formal grammar formalism, introduced for defining complex programming language syntax and semantics, notably used in the specification of ALGOL 68.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Van Wijngaarden grammar | 1 |
| Van Wijngaarden grammars canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T4442189 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Van Wijngaarden grammars Context triple: [Adriaan van Wijngaarden, knownFor, Van Wijngaarden grammars]
-
A.
Backus–Naur Form
Backus–Naur Form is a formal notation used to define the syntax of programming languages and other formal grammars in a precise, structured way.
-
B.
Chomsky hierarchy
The Chomsky hierarchy is a classification of formal grammars into four types that correspond to increasing levels of generative power and computational complexity in formal language theory.
-
C.
General and Rational Grammar
General and Rational Grammar is a 17th-century French linguistic treatise from the Port-Royal school that seeks to explain the universal, rational principles underlying all human languages.
-
D.
Augmented Transition Network
Augmented Transition Network is a type of finite-state machine extended with stack-based memory and procedural actions, widely used in natural language processing for parsing complex sentence structures.
-
E.
Alur language
The Alur language is a Western Nilotic language spoken primarily by the Alur people of northwestern Uganda and northeastern Democratic Republic of the Congo.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Van Wijngaarden grammars Target entity description: Van Wijngaarden grammars are a highly expressive formal grammar formalism, introduced for defining complex programming language syntax and semantics, notably used in the specification of ALGOL 68.
-
A.
Backus–Naur Form
Backus–Naur Form is a formal notation used to define the syntax of programming languages and other formal grammars in a precise, structured way.
-
B.
Chomsky hierarchy
The Chomsky hierarchy is a classification of formal grammars into four types that correspond to increasing levels of generative power and computational complexity in formal language theory.
-
C.
General and Rational Grammar
General and Rational Grammar is a 17th-century French linguistic treatise from the Port-Royal school that seeks to explain the universal, rational principles underlying all human languages.
-
D.
Augmented Transition Network
Augmented Transition Network is a type of finite-state machine extended with stack-based memory and procedural actions, widely used in natural language processing for parsing complex sentence structures.
-
E.
Alur language
The Alur language is a Western Nilotic language spoken primarily by the Alur people of northwestern Uganda and northeastern Democratic Republic of the Congo.
- F. None of above. chosen
Statements (44)
| Predicate | Object |
|---|---|
| instanceOf |
formal grammar formalism
ⓘ
meta-grammar formalism ⓘ two-level grammar ⓘ |
| alternativeName | two-level grammars ⓘ |
| canSpecify |
context-dependent syntax rules
ⓘ
elaborate type-related constraints in syntax ⓘ lexical structure of programming languages ⓘ |
| characteristic |
ability to capture complex context conditions
ⓘ
two-level structure ⓘ use of hyper-rules ⓘ use of meta-variables ⓘ |
| classification | context-sensitive grammar formalism ⓘ |
| comparedTo | context-free grammars ⓘ |
| difficulty |
considered difficult to implement
ⓘ
considered difficult to understand ⓘ |
| expressiveness | highly expressive ⓘ |
| field |
formal language theory
ⓘ
programming language theory ⓘ |
| formalismType | generative grammar ⓘ |
| goal | provide precise language definition independent of implementation ⓘ |
| hasComponent |
hypergrammar
ⓘ
metagrammar ⓘ |
| hasConcept |
hyper-rule
ⓘ
meta-variable ⓘ phrase structure rule schema ⓘ |
| influenced | later grammar formalisms for programming languages ⓘ |
| influencedBy | earlier work on ALGOL language specifications ⓘ |
| introducedBy | Adriaan van Wijngaarden NERFINISHED ⓘ |
| introducedFor | formal definition of ALGOL 68 ⓘ |
| moreExpressiveThan | context-free grammars ⓘ |
| namedAfter | Adriaan van Wijngaarden NERFINISHED ⓘ |
| notableProperty |
can define infinite sets of productions finitely
ⓘ
combine grammar and meta-grammar in one formalism ⓘ |
| notableUse | ALGOL 68 language specification ⓘ |
| relatedTo |
affix grammars
ⓘ
attribute grammars ⓘ macro grammars ⓘ |
| supports |
context-sensitive language description
ⓘ
infinite families of production rules ⓘ parameterized nonterminals ⓘ |
| timePeriod | 1960s ⓘ |
| usedFor |
defining programming language semantics
ⓘ
defining programming language syntax ⓘ |
| usedIn | formal specification of ALGOL 68 report ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Van Wijngaarden grammars Description of subject: Van Wijngaarden grammars are a highly expressive formal grammar formalism, introduced for defining complex programming language syntax and semantics, notably used in the specification of ALGOL 68.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
Van Wijngaarden grammar