Showing papers on "Formal grammar published in 1969"
TL;DR: An explicit expression for the membership function of the language L(G) generated by a fuzzy grammar G is given, and it is shown that any context-sensitive fuzzy grammar is recursive.
322 citations
01 Sep 1969
TL;DR: This paper will study a class of formal grammars with mixed types of rules, which are able to represent the various aspects of language structure in a natural way and generation schemes which map strings into strings in the language of another mixed grammar have been studied.
Abstract: In this paper, we will study a class of formal grammars with mixed types of rules. The reason for considering such grammars is that no single style (i.e., formal character of rules) of formal grammars is able to represent the various aspects of language structure in a natural way. Various considerations for setting up such grammars have been discussed. Generation schemes which map strings in the language of one mixed grammar into strings in the language of another mixed grammar (both strings being 'well-formed') have been studied. Linguistic relevance of these concepts has also been discussed.
14 citations
01 Apr 1969
TL;DR: This dissertation investigates two candidates for formally defining computer languages: the formalism of canonical systems for defining the syntax of a computer language and its translation into a target language and the formalisms of the -calculus and extended Markov algorithms as a combined formalism used as the basis of a targetlanguage for definingThe semantics of aComputer languages.
Abstract: The thesis of this dissertation is that formal definitions of the syntax and semantics of computer languages are needed. This dissertation investigates two candidates for formally defining computer languages: (1) the formalism of canonical systems for defining the syntax of a computer language and its translation into a target language and (2) the formalisms of the -calculus and extended Markov algorithms as a combined formalism used as the basis of a target language for defining the semantics of a computer language. Formal definitions of the syntax and semantics of SNOBOL/1 and ALGOL/60 are included as examples of the approach.
9 citations
Proceedings Article•
01 Jan 19693 citations