Difference between revisions of "Van Wijngaarden grammar"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (Created page with "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 contex...") |
Karl Jones (Talk | contribs) (→See also) |
||
| Line 18: | Line 18: | ||
== See also == | == See also == | ||
| + | * [[Attribute grammar]] | ||
* [[Backus–Naur Form]] | * [[Backus–Naur Form]] | ||
* [[Computer science]] | * [[Computer science]] | ||
| + | * [[Formal grammar]] | ||
== 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 | ||
Revision as of 19:13, 29 February 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
External links
- Van Wijngaarden grammar @ Wikipedia
