Browsing by Advisor "Shankar, Priti"
Now showing items 1-19 of 19
-
A complier writing system based on affix grammars
Compiler Generators have become well-established tools in the production of a compiler. In general, a compiler generator uses a specification of a programming language at an abstract level as input and outputs the code for ... -
Algorithms for some problems on trees and graphs
Design and analysis of graph algorithms is an active area of research in Computer Science. Trees form an important subclass of graphs and have vast applications. In this thesis, we present some new algorithmic results on ... -
Application of finite graph models of context fue languages.
A finite graph model for a context?free language is proposed. The model is called an extended transition system; its nodes encode [pushdown automata state, top stack symbol] pairs and its arcs encode pushdown automaton ... -
Approximate decoding over tail-biting trellises
This thesis proposes and implements soft-decision decoding algorithms on tail-biting trellises. For linear block codes, tail-biting trellises are interesting from a soft-decision decoding view-point, because of their reduced ... -
Computational Problems In Codes On Graphs
(2009-05-11)Two standard graph representations for linear codes are the Tanner graph and the tailbiting trellis. Such graph representations allow the decoding problem for a code to be phrased as a computational problem on the corresponding ... -
Deterministic parsing algorithm for classes beyond CFLs
Deterministic parsing strategies for subclasses of the so-called mildly context-sensitive languages are proposed. Mildly context-sensitive languages are generated by k-level grammars and have parsing algorithms of time ... -
An Environment for Automatic Generation of Code Optimizers
(Indian Institute of Science, 2005-03-11)Code optimization or code transformation is a complex function of a compiler involving analyses and modifications with the entire program as its scope. In spite of its complexity, hardly any tools exist to support this ... -
Experimental Studies On A New Class Of Combinatorial LDPC Codes
(2009-06-05)We implement a package for the construction of a new class of Low Density Parity Check (LDPC) codes based on a new random high girth graph construction technique, and study the performance of the codes so constructed on ... -
Formal Models for Code Generation and Code Compression
We propose formal models for the problems of target code generation and compression of tree intermediate code. For the first problem, we adapt an existing model to work for prefix linearizations of intermediate tree code. ... -
Hierarchical Data Structures data structures based on quadtrees
In the present thesis, a size-based hierarchical ordering of the codes of the linear quadtree, called the Linear Hierarchical Quadtree (LHQT), is shown to reduce the time spent while exploring the adjacencies, without any ... -
Integrating A New Cluster Assignment And Scheduling Algorithm Into An Experimental Retargetable Code Generation Framework
(2009-03-09)This thesis presents a new unified algorithm for cluster assignment and acyclic region scheduling in a partitioned architecture, and preliminary results on its integration into an experimental retargetable code generation ... -
A New Algorithm For Linear Tree Pattern Matching
(2012-05-03) -
New algorithm for linear tree pattern matching
Tree pattern matching is foundational to a wide variety of applications in Computer Science. We consider the problem of linear tree pattern matching and adopt a technique used for parsing context-free languages for this ... -
New Approaches And Experimental Studies On - Alegebraic Attacks On Stream Ciphers
(2015-02-05)Algebraic attacks constitute an effective class of cryptanalytic attacks which have come up recently. In algebraic attacks, the relations between the input, output and the key are expressed as a system of equations and ... -
Optimal linear regular tree pattern matching using pushdown automata
Code generation is a difficult and complex phase of compiler writing. Most problems associated with the code generation phase are NP-complete; therefore, heuristics have been employed to solve them. Instruction selection ... -
Parallel algorithms for compilation
This thesis discusses the design of parallel algorithms for the compilation process. The model of computation is an SIMD (Single Instruction, Multiple Data) computer with shared memory, where no read or write conflicts are ... -
A Static Slicing Tool for Sequential Java Programs
(2018-07-28)A program slice consists of a subset of the statements of a program that can potentially affect values computed at some point of interest. Such a point of interest along with a set of variables is called a slicing criterion. ...