Record as per Format MSRIT.

F702 Revision 1 M S Ramaiah Institute of Technology Bangalore-560054 Lesson Plan Department: Master of Computer Applications Subject code and Subject: MCA31 - System Software Prepared By: Manish Kumar Reviewed By: Chethan Venkatesh Total Contact Hours: 5 Hours/week Total No. of Sessions Required: 42+14 SEE Marks: 50 Session No 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. 27. 28. 29. 30. Topic MACHINE ARCHITECTURE Introduction, System Software and Machine Architecture The Simplified instructional Computers (SIC)-SIC machine architecture. SIC/XE machine architecture. SIC programming Examples ASSEMBLERS Basic Assembler Functions- A simple SIC Assembler Assembler Algorithm, Data Structures Machine Dependent Assembler Features Instruction Formats and addressing modes, Program Relocation, Machine Independent Assembler Features-Literals Symbol Defining statements, Expressions Program Blocks, Control Sections and Program Linking Assembler Design Options-One Pass Assemblers, Multi Pass Assemblers Implementation Example-MASM Assembler LOADERS and LINKERS Basic Loader Functions- Design of an Absolute Loader A simple Bootstrap Loader Machine Dependent Loader Features-Relocation, Program Linking Algorithm and Data Structures for a Linking Loader Machine independent Loader Features-Automatic Library Search, Loader Options Loader Design Options-Linkage editor, Dynamic Linking, Implementation Example -MS DOS Linker MACRO PROCESSORS Basic Macro Processor Functions-Macro Definition and Expansion Macro Processor Algorithm & Data Structures Machine independent Macro Processor Features- Concatenation of Macro Parameters Generation of Unique Labels, Conditional Macro Expansion, Keyword Macro Parameters Macro Processor design Options overview Implementaion Examples-MASM Macro Processor ANSI C Macroprocessor EDITORS and DEBUGGING SYSTEMS OVERVIEW Text Editors-Overview of editing process, User interface, editor structure Interactive Debugging Systems-Debugging Functions and capabilities, Relationship with other parts of the system, User interface criteria. COMPILERS Basic Compiler Functions, Grammars, Lexical analysis Syntactic Analysis, Code Generation Semester: III Credits: 3:0:1 Preparation Date: 26/02/13 Review Date: 26/02/13 CIE Marks: 50 Duration of Final Exam: 3 Hours Duration (Minutes) 55 55 55 55 55 55 55 55 55 55 55 55 55 55 55 55 55 55 55 55 55 55 55 55 55 55 55 55 55 55

31. 32. 33. 34. 35. 36. 37. 38. 39. 40. 41. 42.

Machine dependent Compiler Features, Intermediate form of the program Machine dependent Code optimization, Machine independent Compiler Features, Structured Variables, Machine independent Code Optimization, Storage Allocation Block structured Languages, Compiler Design Options: Interpreter LEX AND YACC Lex and YACC: The Simplest Lex Program, Recognizing Words with Lex, Symbol Tables Grammars, Parser Lexer Communication, The Parts of Speech Lexer, A YACC Parser, The Rules Section, Running Lex and YACC Using LEX: Regular Expression, Examples of Regular Expressions A Word Counting Program, Parsing and Command Line Using YACC: Grammars, Recursive Rules, Shift/Reduce Parsing, What YACC Cannot Parse. A YACC Parser, The Definition Section, The Rules Section, Symbol Values and Actions, The Lexer, Compiling and Running a Simple Parser, Arithmetic Expressions and Ambiguity, Variables and Typed Tokens. Laboratory

55 55 55 55 55 55 55 55 55 55 55 55

Session No. 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14.

Topics Program to recognize tokens using Lex Program to recognize tokens using Lex Program for character/text searching and replacing using Lex Program for character/text searching and replacing using Lex Program to handle arithmetic expressions using Lex Program to handle arithmetic expressions using Lex Program to recognize the identifiers in an input file Program to recognize/validate text/expressions using Yacc Program to recognize/validate text/expressions using Yacc Program for evaluation of arithmetic expressions using Yacc Program to recognize and validate expressions from an input file Yacc Program to recognize any given grammar Yacc Program to recognize any given grammar Yacc Program to recognize any given grammar Yacc

Duration (minutes) 110 110 110 110 110 110 110 110 110 110 110 110 110 110

Text Books: 1. Leland.L.Beck and D. Manjula: System Software, 3rd Edition, Pearson Education, 2007 Chapters 1 (except 1.4, 1.5), 2 (except 2.5.2, 2.5.3), 3(except 3.4.3, 3.5.2 & 3.5.3), 4(except 4.4.3) 5.1, 5.2, 5.3, 5.4.2, 7.2, 7.3 2. John.R.Levine, Tony Mason and Doug Brown: Lex and Yacc, O'Reilly, SPD, 1999 Chapters 1, 2 (Page 27-42), 3 (Page 51-65) Reference Books: D.M.Dhamdhere: System Programming and Operating Systems, 2nd Edition, Tata McGraw - Hill, 1999

Continuous Internal Evaluation Scheme: Max. Marks: 50 Marks A) Theory B) Lab Test C) Continuous Evaluation - Lab Total Marks: 50 Marks (A + B+C) : 20 Marks (Average of Best 2 out of 3) : 25 Marks (20 Marks Execution + 5 Marks Viva) Average of 2 Tests : 5 Marks

Term 6th March 2013 to 29th June 2012

Section

Staff (Name & Signature with Date) Manish Kumar

HOD (Signature with Date)