String grammar

<h2 id="benefits-of-using-a-string-grammar">Benefits of using a string grammar</h2>
<p>When a <i>string grammar</i> is used to define a computer language, some string-grammar <a href="/facts/Parsing/nRKB01S3">parsing</a> tools and <a href="/facts/Compiler_generator/Ud51JPrv">compiler-generator</a> tools can be used to more easily create a <a href="/facts/Compiler/WNfCDFJe">compiler</a> software system for that particular computer language. Because other grammars can be more difficult to use for parsing text written in a specific computer language, using a string grammar is a means to seek simplicity in language processing.
</p>
<h2 id="unrelated-terms-that-may-be-confused">Unrelated terms that may be confused</h2>
<p>Sometimes the word "string" precedes "grammar" in unrelated terms. An example is "<a href="/facts/IP_address/z9V22Sw9">address string</a> grammar", which is a grammar for <a href="/facts/Internet_Protocol/Qq6VeEal">Internet Protocol</a> address strings.<a class="footnote-ref" id="fnref:4" href="#fn:4"><sup>4</sup></a>
Another is the term "numeric string grammar" which refers to <i>numeric strings</i> (strings which denote numbers or numerals).<a class="footnote-ref" id="fnref:5" href="#fn:5"><sup>5</sup></a>
</p>
<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/Formal_grammar/QLxaQNAz">Formal grammar</a></li>
<li><a href="/facts/Tree-adjoining_grammar/gfr3weUw">Tree-adjoining grammar</a></li>
<li><a href="/facts/Context-free_grammar/yu1FFdK4">Context-free grammar</a></li>
<li><a href="/facts/LALR/4ey0KkTU">LALR</a></li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1"><p>Cohn, Trevor; Blunsom, Phil (2009). "A Bayesian model of syntax-directed tree to string grammar induction". Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing Volume 1 – EMNLP '09. Vol. 1. Morristown, NJ, USA: Association for Computational Linguistics. pp. 352–361. doi:10.3115/1699510.1699557. ISBN 978-1-932432-59-6. S2CID 2785745. <a href="978-1-932432-59-6" target="_blank">978-1-932432-59-6</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
<li id="fn:2"><p>Salkoff, M.; Sager, N. (1967). "The elimination of grammatical restrictions in a string grammar of English". Proceedings of the 1967 conference on Computational linguistics. pp. 1–15. doi:10.3115/991566.991582. S2CID 12583235. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li>
<li id="fn:3"><p>Salkoff, Morris (1999). A French-English Grammar: A Contrastive Grammar on Translational Principles. Lingvisticæ Investigationes Supplementa. Vol. 22. p. 12. doi:10.1075/lis.22. ISBN 978-90-272-3131-4. <a href="978-90-272-3131-4" target="_blank">978-90-272-3131-4</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li>
<li id="fn:4"><p>"Programming in Apache Qpid: 2.4.4. Address String Grammar". Red Hat Customer Portal. Retrieved 2019-10-01. <a href="http://docs.redhat.com/docs/en-US/Red_Hat_Enterprise_MRG/1.3/html/Programming_in_Apache_Qpid/sect-Programming_in_Apache_Qpid-Addresses-Address_String_Grammar.html" target="_blank">http://docs.redhat.com/docs/en-US/Red_Hat_Enterprise_MRG/1.3/html/Programming_in_Apache_Qpid/sect-Programming_in_Apache_Qpid-Addresses-Address_String_Grammar.html</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li>
<li id="fn:5"><p>"Variable Typing (The GNU Awk User's Guide)". GNU.org. Retrieved 2019-10-01. <a href="https://www.gnu.org/software/gawk/manual/html_node/Variable-Typing.html" target="_blank">https://www.gnu.org/software/gawk/manual/html_node/Variable-Typing.html</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li>
</ol>

String grammar open-in-new

String grammar