iXML Community Group Test Suite
23 Oct 2023 (22 Nov 2023)
Top-level catalog for tests in the iXML Community Group Test Suite.
Tests have been contributed from several sources, but the core of the test collection are the tests contributed by Steven Pemberton in December 2021.
Misc tests 3
28 Jun 2022
Grammars 41-60.
Tests compiled manually in 2018 and 2019, re-packaged and extended (supplying test cases where needed) in 2022.
Note that some tests have alternate results for processors operating in non-standard modes, in particular modes in which they tolerate multiple definitions and undefined nonterminals or in which they do not tolerate non-productive nonterminals or unreachable nonterminals.
For a description of the form in which alternate results are recorded, see tests/misc-grammar/test-catalog.xml.
sample.grammar.56
Created 08 Feb 2022 by cmsmcq
A grammar with undefined, unproductive, and unreachable nonterminals.
Alternate expected results are given for processors running with an option to tolerate multiple definitions and undefined symbols.
Invisible XML Grammar
{ Sample grammar adapted from Dick Grune and Ceriel J. H. Jacobs,
Parsing techniques: A practical guide (New York: Ellis Horwood, 1990;
second edition New York: Springer, 2008), pp. 109 (1e) and 142 (2e).
This is an augmented form of the regular grammar in 55, intended to
illustrate the existence of undefined, unproductive, and unreachable
non-terminals in regular grammars.
}
{ Revisions:
2018-08-09 : CMSMcQ : made first transcription.
}
S: "a", A; "a", B.
A: "b", B.
A: "b", C.
B: "c", A.
B: "c", C.
C: "a".
B: "c", D. { undefined }
B: "c", E.
E: "e", E. { unproductive }
F: "f", A. { unreachable }
F: "h".
Test case: Grammar test
Repository URI: …/tests/misc/misc-041-060-catalog.xml
Application specific extension
Expected result
<ixml xmlns:ap="http://blackmesatech.com/2019/iXML/Aparecium"
xmlns:ixml="http://invisiblexml.org/NS"
xmlns:tc="https://github.com/invisibleXML/ixml/test-catalog">
<comment> Sample grammar adapted from Dick Grune and Ceriel J. H. Jacobs,
Parsing techniques: A practical guide (New York: Ellis Horwood, 1990;
second edition New York: Springer, 2008), pp. 109 (1e) and 142 (2e).
This is an augmented form of the regular grammar in 55, intended to
illustrate the existence of undefined, unproductive, and unreachable
non-terminals in regular grammars.
</comment>
<comment> Revisions:
2018-08-09 : CMSMcQ : made first transcription.
</comment>
<rule name="S">
<alt>
<literal string="a"/>
<nonterminal name="A"/>
</alt>
<alt>
<literal string="a"/>
<nonterminal name="B"/>
</alt>
</rule>
<rule name="A">
<alt>
<literal string="b"/>
<nonterminal name="B"/>
</alt>
</rule>
<rule name="A">
<alt>
<literal string="b"/>
<nonterminal name="C"/>
</alt>
</rule>
<rule name="B">
<alt>
<literal string="c"/>
<nonterminal name="A"/>
</alt>
</rule>
<rule name="B">
<alt>
<literal string="c"/>
<nonterminal name="C"/>
</alt>
</rule>
<rule name="C">
<alt>
<literal string="a"/>
</alt>
</rule>
<rule name="B">
<alt>
<literal string="c"/>
<nonterminal name="D"/>
</alt>
</rule>
<comment> undefined </comment>
<rule name="B">
<alt>
<literal string="c"/>
<nonterminal name="E"/>
</alt>
</rule>
<rule name="E">
<alt>
<literal string="e"/>
<nonterminal name="E"/>
</alt>
</rule>
<comment> unproductive </comment>
<rule name="F">
<alt>
<literal string="f"/>
<nonterminal name="A"/>
</alt>
</rule>
<comment> unreachable </comment>
<rule name="F">
<alt>
<literal string="h"/>
</alt>
</rule>
</ixml>