/ Misc tests 2 / sample.grammar.31 / g31.c01

CoffeeFilter Test Report

Report generated on 06 Aug 2023 at 21:03 with CoffeeFilter version 3.2.1 (using CoffeeGrinder version 3.2.1) from a test suite dated 21 Jun 2022 (20 Jun 2023).

Description

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 2

28 Jun 2022

Description

Grammars 21-40.

Test grammars compiled manually in 2018 and 2019, re-packaged in 2022.

Added test cases where needed and moved to ixml test collection, June 2022.

sample.grammar.31

Created 08 Feb 2022 by cmsmcq

Description

An attempt to isolate the bug caused by the initial version of sample.grammar.03 (toy CSS grammar).

(Like 30, but the two branches are not identical.

Invisible XML Grammar

	name: ["a"-"z"]; ["a"-"z";"A"-"Z"].

Test case: g31.c01

Repository URI: …/tests/misc/misc-021-040-catalog.xml

Description

This test case illustrates another way different processors will differ in detection of ambiguity. (Cf. test set sample.grammar.g30.) Formalists define production rules as sequences of terminal symbols, and define terminals as primitive symbols, not complex structures like character sets. Formally the grammar given is just an shorter way of writing the grammar "name = 'a';'b'; ... ;'z';'A'; ... ;'Z'. The appearance of having two distinct right-hand sides is only an illusion: formally, the rule has 52 right-hand sides, each a sequence containing one basic symbol.

The same two analyses apply as for sample.grammar.30: the sentence is unambiguous, because there is only one parse tree, or the sentence is ambiguous because we use either the first or the second character set.

The spec allows variation, so the test suite does not take sides.

Input string (1 character)
p
Description

This test case illustrates another way different processors will differ in detection of ambiguity. (Cf. test set sample.grammar.g30.) Formalists define production rules as sequences of terminal symbols, and define terminals as primitive symbols, not complex structures like character sets. Formally the grammar given is just an shorter way of writing the grammar "name = 'a';'b'; ... ;'z';'A'; ... ;'Z'. The appearance of having two distinct right-hand sides is only an illusion: formally, the rule has 52 right-hand sides, each a sequence containing one basic symbol.

The same two analyses apply as for sample.grammar.30: the sentence is unambiguous, because there is only one parse tree, or the sentence is ambiguous because we use either the first or the second character set.

The spec allows variation, so the test suite does not take sides.

Expected results (one of)
<name xmlns:ixml="http://invisiblexml.org/NS"
      xmlns:tc="https://github.com/invisibleXML/ixml/test-catalog">p</name>

<name xmlns:ixml="http://invisiblexml.org/NS"
      xmlns:tc="https://github.com/invisibleXML/ixml/test-catalog"
      ixml:state="ambiguous">p</name>

Test report

PASS