You are on page 1of 3

Unit I: Introduction: Alphabets, Strings and Languages; Automata and Grammars

,
Deterministic finite
Automata (DFA)-Formal Definition, Simplified notation: State transition graph,
Transition table, Language
of DFA, Nondeterministic finite Automata (NFA), Equivalence of NFA and DFA,
Minimization of Finite
Automata, Regular Expressions, Arden’s theorem.
Unit II: Compiler Structure: Compilers and Translators, Various Phases of Compiler,
Pass Structure of
Compiler, Bootstrapping of Compiler. Lexical Analysis: The role of Lexical Analyzer, A
simple approach to
the design of Lexical Analyzer, Implementation of Lexical Analyzer. The Syntactic
Specification of
Programming Languages: CFG, Derivation and Parse tree, Ambiguity, Capabilities of
CFG. Basic Parsing
Techniques: Top-Down parsers with backtracking, Recursive Descent Parsers, Predictive
Parsers,
Unit III: Bottom–up Parsers, Shift-Reduce Parsing, Operator Precedence Parsers, LR
parsers (SLR,
Canonical LR, LALR) Syntax Analyzer Generator: YACC, Intermediate Code
Generation: Different
Intermediate forms: three address code, Quadruples & Triples. Syntax Directed
translation mechanism and
attributed definition. Translation of Declaration, Assignment, Control flow, Boolean
expression, Array
References in arithmetic expressions, procedure calls, case statements, postfix translation.
Unit IV: Run Time Memory Management: Static and Dynamic storage allocation, stack
based memory
allocation schemes, Symbol Table management Error Detection and Recovery: Lexical
phase errors,
Syntactic phase errors, Semantic errors.

avoidance. Unit II: Distributed Deadlock Detection: system model. System models. centralized dead lock detection. Fundamental Models Theoretical Foundation for Distributed System : Limitation of Distributed system. classification of Agreement Problem. Data flow analyzer. path pushing algorithms. Loop optimization. Byzantine agreement problem. Agreement Protocols: Introduction. Order of evaluation. Peephole optimization. edge chasing algorithms. Logical clocks. Register allocation and code selection Unit I: Characterization of Distributed Systems: Introduction. shared memory. Lamport’s & vectors logical clocks. Resource sharing and the Web Challenges. System Models: Architectural models. Token based and non token based algorithms. absence of global clock.Unit V: Code Optimization and Code Generation: Local optimization. Examples of distributed Systems. deadlock prevention. Consensus problem. requirement of mutual exclusion theorem. . distributed dead lock detection. resource Vs communication deadlocks. Distributed Mutual Exclusion: Classification of distributed mutual exclusion. Basic blocks and flow graphs. DAG. Machine Model. detection & resolution.

Election algorithm. Atomic Commit protocols.Unit III: Distributed Objects and Remote Invocation: Communication between distributed objects. Concurrency control in distributed transactions. Replication: System model and group communication. Java RMI case study. Distributed File Systems: File service architecture. Transactions with replicated data. Distributed deadlocks. Deadlock free Packet switching. The Andrew File System. Fault-tolerant services. Events and notifications. CORBA services . Unit V: Distributed Algorithms: Destination based routing. Security: Overview of security techniques. Transaction recovery. CORBA Case Study: CORBA. APP (assignment problem in parallel). Unit IV: Distributed Transactions: Flat and nested distributed transactions. Remote procedure call. Sun Network File System. Introduction to Wave & traversal algorithms.