Data Language Specification via Terminal Attribution

Autor:	Sakharov, Alexander, Sakharov, Timothy
Rok vydání:	2015
Předmět:	Computer Science - Formal Languages and Automata Theory
Druh dokumentu:	Working Paper
Popis:	Unstructured data have to be parsed in order to become usable. The complexity of grammar notations and the difficulty of grammar debugging limit the use of parsers for data preprocessing. We introduce a notation in which grammars are defined by simply dividing terminals into predefined classes and then splitting elements of some classes into multiple layered sub-groups. These LL(1) grammars are designed for data languages. They simplify the task of developing data parsers. Comment: This is a detailed description of tier grammar properties including proofs. Tier grammars are defined in paper 'Data Parsing Using Tier Grammars' by the same authors, appearing in the Proceedings of the 7th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management, Lisbon, Portugal (2015), 463-468
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1511.00909 Zobrazit plný text záznamu View this record from Arxiv