Back to Search
Start Over
Relation grammars and their application to multi-dimensional languages
- Source :
- Journal of Visual Languages & Computing. 2:333-346
- Publication Year :
- 1991
- Publisher :
- Elsevier BV, 1991.
-
Abstract
- Relation grammars are introduced as a powerful formalism for specifying the syntax of visual languages and, more generally, of multi-dimensional languages. Textual languages use only the implicit relation of sequential concatenation of symbols. The proposed extension relax this limitation and allows the introduction of any number of relations. By analogy with textual grammars, relation grammars make it easier to recognize the purpose of the lexical analysis phase and that of the syntactic one for parsing multi-dimensional structures.
- Subjects :
- Computer science
business.industry
Programming language
Context-sensitive grammar
Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)
Context-free grammar
computer.software_genre
Language and Linguistics
Computer Science Applications
Human-Computer Interaction
Tree-adjoining grammar
TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES
Indexed grammar
Artificial intelligence
Definite clause grammar
L-attributed grammar
Phrase structure grammar
business
computer
Computer Science::Formal Languages and Automata Theory
Natural language processing
c-command
Subjects
Details
- ISSN :
- 1045926X
- Volume :
- 2
- Database :
- OpenAIRE
- Journal :
- Journal of Visual Languages & Computing
- Accession number :
- edsair.doi.dedup.....5ae97eb34900093ebc0fc511606af847