2015/11/03 by Alexander Sakharov, Sakharov, Alexander, Timothy Sakharov +1
Computer Science · #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #cs.FL
paper · pdf · doi:10.48550/arxiv.1511.00909
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
arxiv created 2015/11/03 · arxiv updated 2015/11/04
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.