Test cases for invisible-xml processors
This project is maintained by cmsmcq
This directory contains contains a collection of tests for a set of very small invisible-XML grammars. Material here includes:
Grammar g010 (generates empty string): ixml, XML, positive tests, negative tests and the regular superset O3 of grammar g010 from which they were generated
Grammar g011 (generates sequences of ‘a’ characters): ixml, XML, positive tests, negative tests and the regular superset O3 of grammar g011 from which they were generated
Grammar g012 (generates strings of non-blank, non-C0 XML characters): ixml, XML, positive tests, negative tests and the regular superset O3 of grammar g012 from which they were generated
Grammar g022 (generates strings of alternating ‘a’ and ‘b’): ixml, XML, positive tests, negative tests and the regular superset O3 of grammar g022 from which they were generated
Grammar g101 (generates no strings: grammar is unsatisfiable): ixml, XML, positive tests, negative tests and the regular superset O3 of grammar g101 from which they were generated
Grammar g102 (unsatisfiable, generates no strings): ixml, XML, positive tests, negative tests and the regular superset O3 of grammar g102 from which they were generated
Grammar g112 (generates non-empty strings of the letter ‘a’): ixml, XML, positive tests, negative tests and the regular superset O3 of grammar g112 from which they were generated