Quinn Tyler Jackson

Learn More
Traditionally, correct parsing of XML and HTML has been littered with semantic hacks in the parsing code to deal with the oddities of these languages, since HTML accepts unbalanced tags and tags that do not match in case, but XML is less forgiving. The detection of well-formedness of XML documents has, to date, required semantic analysis outside of the(More)
We introduce a fifth language accepting machine called the PDA-T, demonstrate some of its interesting formal properties, and show its role in the §-Calculus 1. Based upon this new machine and the §-Calculus' other properties , we demonstrate the §-Calculus' formal Turing Power, and then propose a formal language classification (the §-Hierarchy), derived(More)
Although in the realm of artificial language it is possible to construct languages that do not comprise expressions that are at once both ambiguous and semantically legal, some artificial languages, and all natural languages, present ambiguous constructs that are nonetheless semantically legal expressions accepted by the language. We introduce the(More)
  • 1