24 lines
1.2 KiB
XML
24 lines
1.2 KiB
XML
|
<page title="Test suites for language tag software">
|
||
|
|
||
|
<ul>
|
||
|
<li>Stéphane Bortzmeyer's test suites. The format is "tag
|
||
|
whitespace optional-comment":
|
||
|
<ul>
|
||
|
<li><a href="test-suites/well-formed-tags.txt">Well-formed tags</a>
|
||
|
(they may be invalid)</li>
|
||
|
<li><a href="test-suites/broken-tags.txt">Not well-formed tags</a></li>
|
||
|
<li><a href="test-suites/valid-tags.txt">Valid tags</a> (for the
|
||
|
2006-11-15 registry)</li>
|
||
|
<li><a href="test-suites/invalid-tags.txt">Invalid tags</a> (for the
|
||
|
2006-11-15 registry, they may be valid now, the current registry is <lsr-version/>!)</li>
|
||
|
</ul>
|
||
|
</li>
|
||
|
<li><a href="http://unicode.org/cldr/data/tools/java/org/unicode/cldr/util/data/langtagTest.txt">ICU test suite</a></li>
|
||
|
<li>From the <wikipedia name="Formal grammar">grammar</wikipedia> in
|
||
|
the RFC, you can use programs like <a href="http://www.quut.com/abnfgen/">abnfgen</a> or <a
|
||
|
href="http://www.bortzmeyer.org/eustathius-test-grammars.html">eusthathius</a> to generate tags for testing a
|
||
|
parser. <em>Warning</em>: these tags will follow the grammar but may
|
||
|
not be well-formed, since some rules are not in the grammar (for
|
||
|
instance the rule that no two singletons must be identical).</li>
|
||
|
</ul>
|
||
|
</page>
|