String grammar

<p>The term "string grammar" in <a href="/facts/Computational_linguistics/XmegJ6LC">computational linguistics</a>  refers to the structure of a specific language, such that it can be formatted as a single continuous string of text, without the need to have line-breaks (or newlines) to alter the meaning. The appearance of any text in "column 1" (or any column) of a line does not change the meaning of that text in a string <a href="/facts/Formal_grammar/QLxaQNAz">grammar</a>. A string grammar can be used to describe the structure of some <a href="/facts/Natural_language/B4gLS7Kd">natural languages</a>, such as English or <a href="/facts/French_language/qe1DnaQh">French</a>, as well as for some computer languages.
</p><p>Note that the string-based structure is for defining the <a href="/facts/Formal_grammar/QLxaQNAz">grammar</a> of a language, rather than the formatting of the language itself. The <a href="/facts/Production_(computer_science)/J7E2FXKs">production rules</a>, of the grammar, are in the form of continuous text strings.
</p>

String grammar open-in-new

String grammar