Miha Drole (2011) Parsing Mildly Context-Sensitive Languages. EngD thesis.
In this thesis we discuss four formalisms, that lie between context-free grammars (KNG) and context-sensitive grammars (KOG) in the Chomsky hierarchy, namely tree-adjoining grammars (TAG), head grammars (HG), linear indexed grammars (LIG) and combinatory categorial grammars (KKG). For each formalism discussed we include its description with basic definitions and descriptions of proofs of their placement in the hierarchy. For TAG we give the proof that they can generate all the languages that can be generated by KNG and some that cannot. In chapters dedicated to HG, LIG and KKG we describe proofs for their mutual equivalence and equivalence with TAG using the transitivity of equivalence. Each proof of equivalence consists of two steps. For the chosen formalism we first give the proof that the set of languages generated by it can also be generated by another formalism in the group. In the second part of the proof we provide a description of the proof that the chosen formalism can generate all the languages that another formalism in the group can generate. For TAG, LIG and KKG we also present recognition algorithms. All algorithms presented have O(n^6) time complexity. In case of KKG we also present an algorithm that builds a description of all parse trees for an input.
|Item Type: ||Thesis (EngD thesis)|
|Keywords: ||formal languages, context-sensitive grammars, tree-adjoining grammars, head grammars, linear indexed grammars, combinatory categorial grammars|
|Number of Pages: ||55|
|Language of Content: ||Slovenian|
|Mentor / Comentors: |
|Name and Surname||ID||Function|
|prof. dr. Igor Kononenko||237||Mentor|
|Link to COBISS: ||http://www.cobiss.si/scripts/cobiss?command=search&base=50070&select=(ID=00008481108)|
|Institution: ||University of Ljubljana|
|Department: ||Faculty of Computer and Information Science|
|Item ID: ||1424|
|Date Deposited: ||05 Jul 2011 12:52|
|Last Modified: ||13 Aug 2011 00:39|
Actions (login required)