Difference between revisions of "Van Wijngaarden grammar"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (→See also) |
Karl Jones (Talk | contribs) |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
| − | In [[computer science]], a '''Van Wijngaarden grammar''' (also vW-grammar or W-grammar) is a two-level grammar which provides a technique to define potentially infinite context-free grammars in a finite number of rules. | + | In [[computer science]], a '''Van Wijngaarden grammar''' (also vW-grammar or W-grammar) is a [[two-level grammar]] which provides a technique to define potentially infinite [[Context-free grammar|context-free grammars]] in a finite number of rules. |
== Description == | == Description == | ||
| Line 9: | Line 9: | ||
Typical applications include: | Typical applications include: | ||
| − | * The treatment of gender and number in natural language syntax | + | * The treatment of gender and number in [[natural language]] syntax |
| − | * The well-definedness of identifiers in programming languages | + | * The well-definedness of identifiers in [[programming languages]] |
The technique was used and developed in the definition of the programming language [[ALGOL 68]]. | The technique was used and developed in the definition of the programming language [[ALGOL 68]]. | ||
| Line 18: | Line 18: | ||
== See also == | == See also == | ||
| + | * [[Affix grammar]] | ||
* [[Attribute grammar]] | * [[Attribute grammar]] | ||
* [[Backus–Naur Form]] | * [[Backus–Naur Form]] | ||
* [[Computer science]] | * [[Computer science]] | ||
| + | * [[Context-free grammar]] | ||
* [[Formal grammar]] | * [[Formal grammar]] | ||
| + | * [[Intermediate language]] | ||
== External links == | == External links == | ||
* [https://en.wikipedia.org/wiki/Van_Wijngaarden_grammar Van Wijngaarden grammar] @ Wikipedia | * [https://en.wikipedia.org/wiki/Van_Wijngaarden_grammar Van Wijngaarden grammar] @ Wikipedia | ||
| + | |||
| + | |||
| + | [[Category:Computer programming]] | ||
| + | [[Category:Computer science]] | ||
Latest revision as of 18:28, 27 April 2016
In computer science, a Van Wijngaarden grammar (also vW-grammar or W-grammar) is a two-level grammar which provides a technique to define potentially infinite context-free grammars in a finite number of rules.
Description
The formalism was invented by Adriaan van Wijngaarden to define rigorously some syntactic restrictions which previously had to be formulated in natural language, despite their essentially syntactical content.
Applications
Typical applications include:
- The treatment of gender and number in natural language syntax
- The well-definedness of identifiers in programming languages
The technique was used and developed in the definition of the programming language ALGOL 68.
It is an example of the larger class of affix grammars.
See also
- Affix grammar
- Attribute grammar
- Backus–Naur Form
- Computer science
- Context-free grammar
- Formal grammar
- Intermediate language
External links
- Van Wijngaarden grammar @ Wikipedia
