Theory: 4 Hrs/Week Max. University Theory Examination: 60 Marks Max. Time for Theory Exam.: 3 Hrs. Continuous Internal Assessment: 40 Marks
|
|
- Lawrence Daniel
- 5 years ago
- Views:
Transcription
1 School: Computer Science & Application Year : Second Year Course: Compiler Design Programme: M.C.A. Semester - IV Course Code: CSA0100P402 Theory: 4 Hrs/Week Max. University Theory Examination: 60 Marks Max. Time for Theory Exam.: 3 Hrs. Continuous Internal Assessment: 40 Marks Objectives 1 To introduce the major concept areas of language translation and compiler design 2 To enrich the knowledge in various phases of compiler. 3 To understand role of lexical analyzer and grammars for a programming language 4 To know the importance of code optimization. Unit Number Details Introduction to Compiling and Lexical Analysis: Introduction to Compiler, Single and Multi-Pass Compilers, Translators, Phases of Compilers, Compiler writing tools. Definition, analysis of the source program, the phases of a compiler, the grouping of phases, Compiler- Construction tools, The role of the Lexical analyzer, Input buffering, Specification of Tokens, A Language for Specifying Lexical Analyzers, Design of a Lexical Analyzer generator. Syntax Analysis and Parsing: The role of the Parser, Context-free grammars, Writing a Grammar, Top-Down Parsing, Bottom Up Parsing, Operator-precedence Parsing, LR-Parsers, Using Ambiguous Grammars, Parser Generators. Syntax-Directed Translation: Definitions, Synthesized and inherited attributes, Construction of Syntax Trees, bottom up and top down evaluation of attributes, S-attributed and L-attributed definitions Top- Down Translation, Bottom-Up Evaluation of Inherited attributes. Intermediate Code: Generation Intermediate Languages, Declarations, Assignment Statements, Case Statements, Back patching, Boolean Expressions and Procedure Calls. Hours 12 7
2 5 Code Optimization and Code Generation: Principal sources of Optimization, Optimization of basic blocks, Peephole Optimization. Issues in the Design of a Code Generator, The target Machine, Basic Blocks and Flow Graphs, Simple Code Generator, Register allocation and Assignment, The DAG Representation of Basic Blocks, Generating Code from DAGs, Code-Generators. Symbol tables: use and need of symbol tables 10 Total 45 Resources Recommended Books Reference Books Web References 1. Aho, Sethi, Ullman, Compilers-tools and Techniques, Addison Wesley, Alfred V.Aho and J. D. Ullman, Principles of Compiler Design, Narosa Publication. 3. Trembly, Sorenson, Theory and Practice of Compiler Writing, McGraw Hill, Hopcroft, Introduction to Automata Theory, Languages and Computation, Pearson Publication 1. Paul G. Sorenson, Compiler Writing, Tata McGraw Hill. 2. Hunter, The Essence of Compilers, Pearson Publication. 3. Lewis, Elements of the Theory of Computation, Pearson Publication S
3 School: Computer Science and Application Programme: M.C.A. Year: Second Year Semester - IV Course : Lab Course based on Compiler Course Code:CSA0100P406 Design Practical: PG - 4Hrs./Batch (20 Students) Practical Examination: 25 Marks Term Work: 25 Marks Objectives 1 To provide an understanding the basic techniques of compiler construction 2 To provide deeper insights into the more advanced semantics aspects of programming languages, optimizations, dynamic memory allocation, and object orientation. 3 Acquire knowledge about the basic concept of writing a program to perform syntaxdirected translation of a high-level programming language into an executable code. 4 To understand and design code generation schemes Sr. No. Group A: (Any SIX Assignments) Description Design a lexical analyzer for given language and the lexical analyzer should ignore redundant spaces, tabs and new lines. It should also ignore comments. Although the 1 syntax specification states that identifiers can be arbitrarily long, you may restrict the length to some reasonable value. Simulate the same in C language. 2 Write a C program to identify whether a given line is a comment or not. 3 Write a C program to recognize strings under 'a', 'a*b+', 'abb'. 4 Write a C program to test whether a given identifier is valid or not. 5 Write a C program to simulate lexical analyzer for validating operators Implement the lexical analyzer using JLex, flex or other lexical analyzer generating 6 tools a)write a C program for constructing of LL (1) parsing. 7 b)write a C program for constructing recursive descent parsing. Write a C program to implement LALR parsing. a)write a C program to implement operator precedence parsing. 9 b)write a C program to implement Program semantic rules to calculate the expression that takes an expression with digits, + and * and computes the value Group B: (Any Three Assignments) 10 To write a program for implementing Symbol Table using C. 11 To write a program for construction of Operator Precedence Parse Table using C++. To write a program for implementation of Code Optimization Technique in for and dowhile loop using C To write a program for the generation of assembly language code of relational operator.
4 14 To write a program for construction of LR Parsing table using C. Group C: (Any One Assignments) 15 Convert the BNF rules into YACC form and write code to generate abstract syntax tree for the mini language. 16 Write a C program to generate machine code from abstract syntax tree generated by the parser. Term Work: Term Work assessment shall be conducted for the Project, Tutorials and Seminar. Term work is continuous assessment based on work done, submission of work in the form of report/journal, timely completion, attendance, and understanding. It should be assessed by subject teacher of the institute. At the end of the semester, the final grade for a Term Work shall be assigned based on the performance of the student and is to be submitted to the University. Notes 1 The experiments from the regular practical syllabus will be performed (15 Marks). 2 The regular attendance of students during the syllabus practical course will be monitored and marks will be given accordingly (5 Marks). 3 Good Laboratory Practices (5 Marks) Practical/Oral/Presentation: Practical shall be conducted and assessed jointly by internal and external examiners. The performance in the Practical examination shall be assessed by at least a pair of examiners appointed as examiners by the University. The examiners will prepare the mark/grade sheet in the format as specified by the University, authenticate and seal it. Sealed envelope shall be submitted to the head of the department or authorized person. Notes 1 One experiment from the regular practical syllabus will be conducted. (Total 15 Marks). 2 Complete laboratory journal (05 Marks). 3 Viva-voce (05 Marks).
5 School: Computer Science and Application Year: Second Year Course : Lab Course based on Web Technologies Practical: PG - 4 Hrs/Batch (20 Students) Programme:M.C.A. Semester - IV Course Code:CSA0100P407 Practical Examination: 25 Marks Term Work: 25 Marks Objectives 1 To develop an ability to design and implement static and dynamic website 2 To provide technical expertise in implementing web applications. 3 To design interactive web pages using HTML and Style sheets 4 To define CSS and unstaring its purpose different syntax and types of CSS 5 6 To learn about basics of XML and how it can be used to store information away from the mechanism of processing or formatting of such data To learn and get familiar with JavaScript and to apply client side scripting technology such as VBScript with HTML Sr. No. Group A: (Any SIX Assignments) Description 1 Create simple HTML File. Use of various HTML Tags on Web Forms Write a HTML to create an html file to link to different html page which contains images, tables, and also link within a page. Write html page with different types of frames such as floating frame, navigation frame & mixed frame. Develop static pages (using only HTML) of an online Book store. The pages should resemble: The website should consist the following pages. Home page, Registration and user Login, User profile page, Books catalog, Shopping cart etc. Write an XML file which will display the Book information which includes the following: 1) Title of the book 2) Author Name 3) ISBN number 4) Publisher name 5) Edition 6) Price Write a Document Type Definition (DTD) to validate the above XML file. To create an html page named as registration.html a) set background colors b) use table for alignment c) provide font colors & size
6 7 9 To create an html file by applying the different styles using inline, external & internal style sheets. To write a JavaScript program to define a user defined function for sorting the values in an array. To create an html page to explain the use of various predefined functions in a string and math object in java script. Group B: (Any Three Assignments) Write a program of Form processing using JavaScript and Validation of form using JavaScript To create an html page to explain the use of various predefined functions in array & Date object in JavaScript. 12 To display the calendar using JavaScript code by getting the year from the user. 13 To create a html registration form and to validate the form using JavaScript code. 14 To write a program to create xml document using XML language. Group C: (Any One Assignments) 15 To create a table of content using ASP program & navigate within the pages a) To create ASP program to demonstrate request & response object method. b) To display all the content in the database using ASP program. a)to create a CD catalog using XML file b)to create external style sheet and using the style sheet in xml file Term Work: Term Work assessment shall be conducted for the Project, Tutorials and Seminar. Term work is continuous assessment based on work done, submission of work in the form of report/journal, timely completion, attendance, and understanding. It should be assessed by subject teacher of the institute. At the end of the semester, the final grade for a Term Work shall be assigned based on the performance of the student and is to be submitted to the University. Notes 1 The experiments from the regular practical syllabus will be performed (15 Marks). 2 The regular attendance of students during the syllabus practical course will be monitored and marks will be given accordingly (5 Marks). 3 Good Laboratory Practices (5 Marks)
7 Practical/Oral/Presentation: Practical shall be conducted and assessed jointly by internal and external examiners. The performance in the Practical examination shall be assessed by at least a pair of examiners appointed as examiners by the University. The examiners will prepare the mark/grade sheet in the format as specified by the University, authenticate and seal it. Sealed envelope shall be submitted to the head of the department or authorized person. Notes 1 One experiment from the regular practical syllabus will be conducted. (Total 15 Marks). 2 Complete laboratory journal (05 Marks). 3 Viva-voce (05 Marks).
8 School: Computer Science & Application Year : Second Year Course: Theory of Computations Programme: M.C.A. Semester - IV Course Code: CSA0100P401 Theory: 4 Hrs/Week Max. University Theory Examination: 60 Marks Max. Time for Theory Exam.: 3 Hrs. Continuous Internal Assessment: 40 Marks Objectives 1 To build concepts regarding the fundamental principles of Grammars, Automata Theory, Turing Machines 2 To learn formal Programming Language Theory and Regular Expressions 3 To learn Grammar and Turing Machine Designing 4 To study the abstract computing model. 5 To study automata theory and types and applications of formal grammar. Unit Number Details Basic Concepts and Formal Language Theory: Symbol/alphabets, string/word, language, formal language,, Basic Machine, Finite State machine: state tables, transition graph, Finite automata, finite control of FA over string, deterministic finite automaton(dfa) and nondeterministic finite automaton(nfa), conversion of NFA to DFA, concept of moves, NFA with e moves, A with output: Moore and mealey machines-definition, models, inter conversion, Regular Expressions: Formal definition, examples and FA, FA to RE,RE to FA,Recursive definition of regular expression. Regular Grammar and Context Free Languages : Regular Grammar: Definition, left linear and right linear regular grammar, inter conversion between left linear and right linear regular grammar, FA to RG and RG to FA, definition of/for CFL, Properties of CFL Contexts Free Grammars and languages: Grammar- Definition, representation of grammar, parse tree, ambiguity in grammar and language, removal of ambiguity, simplification of grammar, normal forms, Chomsky normal form and greibach normal form, Chomsky hierarchy. Push down automata (PDA): Definition, deterministic, pushes down automata (DPDA), non-deterministic push down automata (NPDA), the language of PDA. Equivalence of PDA s and CFG s, closure properties Hours
9 5 of CFL s. Concept of post machines. Turning Machine: Definition and example of TM, recursive sets, partial recursive function, recursively enumerable sets, computing a partial function with TM, combining TM s variations of TM: Multi-tape TM s, universal TM, model of computation and church s Turing hypothesis, unsolvable problem, TM s halting problem Total 45 Resources Recommended Books Reference Books Web References 1. Daniel I. A. Cohen, "Introduction to automata theory languages and computations, Pearson education asia, second edition 2. HopcroftUlman, Introduction to automata theory, languages and computations, Pearson education Asia, 2nd edition 3. John C. martin, Introduction to language and theory of computation, TMH, 3rd edition 1. E V Krishnamurthy, Introduction to Theory of Computer Science, EWP Second 2nd edition. 2. K.L.P Mishra,N. Chandrasekaran, Theory of computer science (automata, languages and computation), Prentice hall India, 2nd edition 1. ine_introductio
10 School: Computer Science & Application Year : Second Year Course: Web Technologies Theory: 4 Hrs./Week Max. Time for Theory Exam.: 3 Hrs. Programme: M.C.A. Semester - IV Course Code: CSA0100P403 Max. University Theory Examination:60 Marks Continuous Internal Assessment: 40 Marks Objectives 1 To analyze a web page and identify its elements and attributes 2 To understand concepts of developing advanced HTML pages with the help of frames, scripting languages, and evolving technologies like DHTML, and XML 3 To understand web page site planning, management and maintenance 4 To create XML documents and Schema 5 To give the distinguish characteristic of scripting languages Unit Number Details Fundamentals :Internet, WWW,A Brief Introduction to the Internet,Web Browsers and Web Servers, Uniform Resource Locators(URL), Multipurpose Internet Mail Extensions, HTTP,Security, The Web Programmer s Toolbox HTML: Introduction To HTML, WWW, W3C, web publishing, Common HTML, Basic Syntax, Basic Text Markup,Images, Hypertext Links, Lists,Tables Frames, Form Introduction with text box, text area, buttons, List box, radio, checkbox etc. CSS Introduction To Style sheet, types of style sheets- Inline, External, Embedded CSS, text formatting properties, CSS Border, margin properties, Positioning Use of classes in CSS, color properties, use of <div>&<span> Scripting Languages: Java Script (JS) in Web Page, Overview of JavaScript,Advantage of Java Script,types, intro of JavaScript, JavaScript identifiers, control statement, Looping structure, Array: Introduction, Array with methods, Math, String, Date Objects with methods User defined & Predefined functions, The Document Object Model, DOM objects, Window Navigator, History, Location, Event handling, Validations On Forms VBScript :Introduction To VBScript, Data types, Variables, Control of Flow Control Structures & Loops, Functions in VBScript, Client side Hours 9
11 web scripting, Validating forms, DOM, Handling errors 5 XML: Introduction of XML, features, XML writing elements, attributes etc. Document structure, Document, type definitions, XML with CSS, DSO, XML Namespaces XML DTD, and XML Schema, Writing Simple sheets using XSLT, SAX & DOM Parsers, and SOAP Intro. Active Server Page (ASP): Introduction Working with ASP page, ASP object,server object File system object, Role of Global.asa file, Error Handling in ASP,Database Handling: Connection, Recordset, Command Object Total 41 Resources Recommended Books Reference Books Web References 1. Robert W. Sebesta: Programming the World Wide Web, 4th Edition, Pearson education, HTML, DHTML, JavaScript, Perl & CGI Ivan Bayross 3. JavaScript Bible 4. Web enabled commercial application development using HTML, DHTML, JavaScript, PERL-CG 5. VBScript in Nutshell 6. Internet Technology at work Hofstetterfred 7. Beginning XML Wrox Press Programming ASP Ivan Bayross 1. Beginning ASP 3.0 Wrox press 1. ncepts.htm
Evaluation Scheme L T P Total Credit Theory Mid Sem Exam
DESIGN OF LANGUAGE PROCESSORS Semester II (Computer Engineering) SUB CODE: MECE201 Teaching Scheme (Credits and Hours): Teaching scheme Total Evaluation Scheme L T P Total Credit Theory Mid Sem Exam CIA
More informationKALASALINGAM UNIVERSITY ANAND NAGAR, KRISHNAN KOIL DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING ODD SEMESTER COURSE PLAN
Subject with Code KALASALINGAM UNIVERSITY ANAND NAGAR, KRISHNAN KOIL 626 126 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING ODD SEMESTER 2013-2014 Semester/Branch/Section Credits : 3 COURSE PLAN : Compiler
More informationSRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTER SCIENCE AND ENGINEERING COURSE PLAN
SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTER SCIENCE AND ENGINEERING COURSE PLAN Course Code : CS1014 Semester: VI Course Title : System Software and Compiler Design Course Time:
More informationSRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF CSE COURSE PLAN
Course Code : CS0301 Course Title : Compiler Design Semester : V Course Time : July Dec 2011 DAY SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF CSE COURSE PLAN SECTION
More informationPhiladelphia University Faculty of Information Technology Department of Computer Science --- Semester, 2007/2008. Course Syllabus
Philadelphia University Faculty of Information Technology Department of Computer Science --- Semester, 2007/2008 Course Syllabus Course Title: Compiler Construction Course Level: 4 Lecture Time: Course
More informationSRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY
SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTER SCIENCE AND ENGINEERING DEPARTMENT OF CSE COURSE PLAN Course Code : CS0301 Course Title : Compiler Design Semester : V Course Time
More informationG.PULLAIH COLLEGE OF ENGINEERING & TECHNOLOGY
G.PULLAI COLLEGE OF ENGINEERING & TECNOLOGY Nandikotkur Road, Kurnool 518002 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Semester VI (2017-2018) COURSE DESCRIPTION Course Code : 15A05601 Course Title
More informationGovt. of Karnataka, Department of Technical Education Diploma in Computer Science & Engineering. Fifth Semester. Subject: Web Programming
Govt. of Karnataka, Department of Technical Education Diploma in Computer Science & Engineering Fifth Semester Subject: Web Programming Contact Hrs / week: 4 Total hrs: 64 Table of Contents SN Content
More information(a) R=01[((10)*+111)*+0]*1 (b) ((01+10)*00)*. [8+8] 4. (a) Find the left most and right most derivations for the word abba in the grammar
Code No: R05310501 Set No. 1 III B.Tech I Semester Regular Examinations, November 2008 FORMAL LANGUAGES AND AUTOMATA THEORY (Computer Science & Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE
More informationGUJARAT TECHNOLOGICAL UNIVERSITY
Type of course: Core GUJARAT TECHNOLOGICAL UNIVERSITY SUBJECT NAME: Compiler Design SUBJECT CODE: 21701 B.E. 7 th SEMESTER Prerequisite: Data Structures and Algorithms, Theory of Computation, Rationale:
More informationDEPARTMENT OF INFORMATION TECHNOLOGY AUTOMATA AND COMPILER DESIGN. B.Tech-IT, III Year -I Sem
DEPARTMENT OF INFORMATION TECHNOLOGY AUTOMATA AND COMPILER DESIGN B.Tech-IT, III Year -I Sem Dr. Smriti Agrawal Assoc. Professor J.B.Institute of Engg & Technology Yenkapally, Moinabad(Mandal) Himathnagar(post),Hydreabad
More informationSYED AMMAL ENGINEERING COLLEGE (An ISO 9001:2008 Certified Institution) Dr. E.M. Abdullah Campus, Ramanathapuram
CS6660 COMPILER DESIGN Question Bank UNIT I-INTRODUCTION TO COMPILERS 1. Define compiler. 2. Differentiate compiler and interpreter. 3. What is a language processing system? 4. List four software tools
More informationAbout the Authors... iii Introduction... xvii. Chapter 1: System Software... 1
Table of Contents About the Authors... iii Introduction... xvii Chapter 1: System Software... 1 1.1 Concept of System Software... 2 Types of Software Programs... 2 Software Programs and the Computing Machine...
More informationSemester: I Credits: 5. Category: MC No.of hrs/week: 5 CA PROGRAMMING IN C
Semester: I Credits: 5 Category: MC No.of hrs/week: 5 CA1505 - PROGRAMMING IN C Objective: This course aims at explaining the basic concepts of computers and an easy understanding of C Language by the
More informationName of chapter & details
Course Title Course Code Compiler Design CE702 Theory : 03 Course Credit Practical : 01 Tutorial : 00 Course Learning Outcomes The objectives of this course are Credits : 04 Improve the theory and practice
More informationCST-402(T): Language Processors
CST-402(T): Language Processors Course Outcomes: On successful completion of the course, students will be able to: 1. Exhibit role of various phases of compilation, with understanding of types of grammars
More informationCompilers for Modern Architectures Course Syllabus, Spring 2015
Compilers for Modern Architectures Course Syllabus, Spring 2015 Instructor: Dr. Rafael Ubal Email: ubal@ece.neu.edu Office: 140 The Fenway, 3rd floor (see detailed directions below) Phone: 617-373-3895
More informationLECTURE NOTES ON COMPILER DESIGN P a g e 2
LECTURE NOTES ON COMPILER DESIGN P a g e 1 (PCCS4305) COMPILER DESIGN KISHORE KUMAR SAHU SR. LECTURER, DEPARTMENT OF INFORMATION TECHNOLOGY ROLAND INSTITUTE OF TECHNOLOGY, BERHAMPUR LECTURE NOTES ON COMPILER
More informationTranslator Design CRN Course Administration CMSC 4173 Spring 2017
Document: Translator Design Course Administration Revised: January 12, 2015 Course Title: Translator Design Course Number: CMSC 4173 Section: CRN 25838 Thursday 11:00 12:15 p.m. MCS 121 Instructor: Dr.
More informationGUJARAT TECHNOLOGICAL UNIVERSITY
Type of course: System Programming GUJARAT TECHNOLOGICAL UNIVERSITY SYSTEM PROGRAMMING SUBJECT CODE: 21508 B.E. 5 th SEMESTER Prerequisite: Data Structures and Operating Systems Rationale: NA Teaching
More informationINSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad
INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad - 500 043 INFORMATION TECHNOLOGY TUTORIAL QUESTION BANK Course Name Course Code Class Branch : Web Technologies : ACS006 : B. Tech
More informationTranslator Design CRN Course Administration CMSC 4173 Spring 2018
Document: Translator Design Course Administration Revised: February 7, 2018 Course Title: Translator Design Course Number: CMSC 4173 Section: CRN 25838 Monday and Wednesday 5:45 7:00 p.m. MCS 113 Instructor:
More informationBIRLA INSTITUTE OF TECHNOLOGY AND SCIENCE, Pilani Pilani Campus Instruction Division
SECOND SEMESTER 2015-2016 Course Handout (Part II) Date:23-01-2017 In addition to part I (General Handout for all courses appended to the time table) this portion gives further specific details regarding
More informationPrinciples of Programming Languages [PLP-2015] Detailed Syllabus
Principles of Programming Languages [PLP-2015] Detailed Syllabus This document lists the topics presented along the course. The PDF slides published on the course web page (http://www.di.unipi.it/~andrea/didattica/plp-15/)
More informationProgramme: MCA Applications Course Code: PCA401 Year : Second Year Semester - IV Course: Distributed Operating. L T P C System
Course Code: PCA401 Year : Second Year Semester - IV Course: Distributed Operating L T P C System 3 -- -- 3 Theory: 3 Hrs/Week Max. University Theory Examination: 0 Marks Max. Time for Theory Exam.: 3
More informationhrs. Designing Fundamentals 2 Paper-II: Data base hrs. management Systems Semester IV 3 Paper-I: Web
SCHEME OF EXAMINATION FOR B.Sc. COMPUTER APPLICATIONS (VOCATIONAL) SEMESTER SYSTEM Scheme for B.Sc.-II (Vocational) w.e.f. 2014-2015 Sr. No. Paper Internal External Marks Exam Duration Assessment SEMESTER
More informationCS Compiler Construction West Virginia fall semester 2014 August 18, 2014 syllabus 1.0
SYL-410-2014C CS 410 - Compiler Construction West Virginia fall semester 2014 August 18, 2014 syllabus 1.0 Course location: 107 ERB, Evansdale Campus Course times: Tuesdays and Thursdays, 2:00-3:15 Course
More informationSkyup's Media. PART-B 2) Construct a Mealy machine which is equivalent to the Moore machine given in table.
Code No: XXXXX JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD B.Tech II Year I Semester Examinations (Common to CSE and IT) Note: This question paper contains two parts A and B. Part A is compulsory
More informationAdvanced Web Programming (17MCA42)
PESIT- Bangalore South Campus Hosur Road (1km Before Electronic city) Bangalore 560 100 Department of MCA COURSE INFORMATION SHEET Advanced Web Programming (17MCA42) 1. GENERAL INFORMATION Academic Year:
More informationTUTORIAL QUESTION BANK
+ INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad - 500 043 COMPUTER SCIENCE AND ENGINEERING TUTORIAL QUESTION BANK Course Name Course Code Class Branch : Web Technologies : ACS006
More informationQuestion Bank. 10CS63:Compiler Design
Question Bank 10CS63:Compiler Design 1.Determine whether the following regular expressions define the same language? (ab)* and a*b* 2.List the properties of an operator grammar 3. Is macro processing a
More informationFormal Languages and Compilers Lecture I: Introduction to Compilers
Formal Languages and Compilers Lecture I: Introduction to Compilers Free University of Bozen-Bolzano Faculty of Computer Science POS Building, Room: 2.03 artale@inf.unibz.it http://www.inf.unibz.it/ artale/
More informationAIM. 10 September
AIM These two courses are aimed at introducing you to the World of Web Programming. These courses does NOT make you Master all the skills of a Web Programmer. You must learn and work MORE in this area
More informationHOLY ANGEL UNIVERSITY COLLEGE OF INFORMATION AND COMMUNICATIONS TECHNOLOGY COMPILER THEORY COURSE SYLLABUS
HOLY ANGEL UNIVERSITY COLLEGE OF INFORMATION AND COMMUNICATIONS TECHNOLOGY COMPILER THEORY COURSE SYLLABUS Code : 6COMTHEORY Prerequisite : 6AMATA Credit : 3 s (3 hours LEC) Year Level: 3 rd year Degree
More information1 PCA151C Data Structures Using C PCA152C Operating Systems PCA153C Introduction to Web Technologies
Sl. No. Subject code Basaveshwar Engineering College(Autonomous), Bagalkote Department of Computer Applications (MCA) Scheme and syllabus for I Semester MCA 2018-19 No. of hours per week Subject Lecture
More informationFinite Automata Theory and Formal Languages TMV027/DIT321 LP4 2016
Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2016 Lecture 15 Ana Bove May 23rd 2016 More on Turing machines; Summary of the course. Overview of today s lecture: Recap: PDA, TM Push-down
More informationSECOND YEAR III Paper I Applied Mathematics Paper II Microprocessors & Assembly Language Programming
Sem Ins. hrs/ week Dur. CIA Marks Total Marks Credit M.Sc. Software Sys. (Colleges) 2010-11 revised Page 1 of 5 BHARATHIAR UNIVERSITY, COIMBATORE. M. Sc. SOFTWARE SYSTEM (Affiliated Colleges - Effective
More informationCS606- compiler instruction Solved MCQS From Midterm Papers
CS606- compiler instruction Solved MCQS From Midterm Papers March 06,2014 MC100401285 Moaaz.pk@gmail.com Mc100401285@gmail.com PSMD01 Final Term MCQ s and Quizzes CS606- compiler instruction If X is a
More informationProposed Syllabus for F.Y.B.Sc. (Information Technology) (w.e.f. June-2015)
Proposed Syllabus for F.Y.B.Sc. (Information Technology) (w.e.f. June-2015) Scheme Details Examination Pattern : 40 Internal : 60 External Periods : 45 Per Semester Sem I Sem II UG IT 111 Web Design-I
More informationTheory of Programming Languages COMP360
Theory of Programming Languages COMP360 Sometimes it is the people no one imagines anything of, who do the things that no one can imagine Alan Turing What can be computed? Before people even built computers,
More information2068 (I) Attempt all questions.
2068 (I) 1. What do you mean by compiler? How source program analyzed? Explain in brief. 2. Discuss the role of symbol table in compiler design. 3. Convert the regular expression 0 + (1 + 0)* 00 first
More informationSCHEME OF INSTRUCTION & EXAMINATION B.E. III YEAR (COMPUTER SCIENCE & ENGINEERING) With effect from the Academic year
SCHEME OF INSTRUCTION & EXAMINATION B.E. III YEAR (COMPUTER SCIENCE & ENGINEERING) With effect from the Academic year 2013-2014 SEMESTER - I S. No. Syllabus Ref. No. SUBJECT Scheme of Scheme of Examination
More informationBooks : 4 th SEMESTER MCA F.M -70. Programming With Java(3-1-0)Cr.-4. Module-1
MCA 206 Module-1 Programming With Java(3-1-0)Cr.-4 F.M -70 Introduction to Java Programming Language, Java Evolution, Naming Conventions and Datatypes, Operators in Java, Control Statements in Java, Decision
More informationProgramming the World Wide Web by Robert W. Sebesta
Programming the World Wide Web by Robert W. Sebesta Tired Of Rpg/400, Jcl And The Like? Heres A Ticket Out Programming the World Wide Web by Robert Sebesta provides students with a comprehensive introduction
More informationCSCI 565 Compiler Design and Implementation Spring 2014
CSCI 565 Compiler Design and Implementation Spring 2014 Instructor: Description: Prerequisites: Dr. Pedro C. Diniz, e-mail pedro@isi.edu Lectures: Thursday, 8.00 10.50 AM, RTH 217, phone: (213) 740 4518
More informationCMPE 152 Compiler Design
San José State University Department of Computer Engineering CMPE 152 Compiler Design Section 1 (Class) Sections 2 and 3 (s) Fall 2018 Course and Contact Information Instructor: Ron Mak Office Location:
More informationTECNIA INSTITUTE OF ADVANCED STUDIES
Assignment1(UNIT1) Paper Code:MCA201 Paper: Theory of Computation (a) Positive closure. (b) Automata. Lexical analyzer. (d) Transition table. (e) Final state. Chomsky Classification. (ii) Regular Expressions.
More informationR10 SET a) Construct a DFA that accepts an identifier of a C programming language. b) Differentiate between NFA and DFA?
R1 SET - 1 1. a) Construct a DFA that accepts an identifier of a C programming language. b) Differentiate between NFA and DFA? 2. a) Design a DFA that accepts the language over = {, 1} of all strings that
More informationList of Figures. About the Authors. Acknowledgments
List of Figures Preface About the Authors Acknowledgments xiii xvii xxiii xxv 1 Compilation 1 1.1 Compilers..................................... 1 1.1.1 Programming Languages......................... 1
More informationONE-STACK AUTOMATA AS ACCEPTORS OF CONTEXT-FREE LANGUAGES *
ONE-STACK AUTOMATA AS ACCEPTORS OF CONTEXT-FREE LANGUAGES * Pradip Peter Dey, Mohammad Amin, Bhaskar Raj Sinha and Alireza Farahani National University 3678 Aero Court San Diego, CA 92123 {pdey, mamin,
More informationCompiler Design Overview. Compiler Design 1
Compiler Design Overview Compiler Design 1 Preliminaries Required Basic knowledge of programming languages. Basic knowledge of FSA and CFG. Knowledge of a high programming language for the programming
More informationCS/SE 153 Concepts of Compiler Design
San José State University Department of Computer Science CS/SE 153 Concepts of Compiler Design Section 1 Fall 2018 Course and Contact Information Instructor: Ron Mak Office Location: ENG 250 Email: ron.mak@sjsu.edu
More informationShankersinh Vaghela Bapu Institue of Technology
Branch: - 6th Sem IT Year/Sem : - 3rd /2014 Subject & Subject Code : Faculty Name : - Nitin Padariya Pre Upload Date: 31/12/2013 Submission Date: 9/1/2014 [1] Explain the need of web server and web browser
More informationMidTerm Papers Solved MCQS with Reference (1 to 22 lectures)
CS606- Compiler Construction MidTerm Papers Solved MCQS with Reference (1 to 22 lectures) by Arslan Arshad (Zain) FEB 21,2016 0300-2462284 http://lmshelp.blogspot.com/ Arslan.arshad01@gmail.com AKMP01
More informationCS5363 Final Review. cs5363 1
CS5363 Final Review cs5363 1 Programming language implementation Programming languages Tools for describing data and algorithms Instructing machines what to do Communicate between computers and programmers
More informationTheory and Compiling COMP360
Theory and Compiling COMP360 It has been said that man is a rational animal. All my life I have been searching for evidence which could support this. Bertrand Russell Reading Read sections 2.1 3.2 in the
More informationGRAPHIC WEB DESIGNER PROGRAM
NH128 HTML Level 1 24 Total Hours COURSE TITLE: HTML Level 1 COURSE OVERVIEW: This course introduces web designers to the nuts and bolts of HTML (HyperText Markup Language), the programming language used
More informationFormal languages and computation models
Formal languages and computation models Guy Perrier Bibliography John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman - Introduction to Automata Theory, Languages, and Computation - Addison Wesley, 2006.
More informationCMPE 152 Compiler Design
San José State University Department of Computer Engineering CMPE 152 Compiler Design Course and contact information Instructor: Ron Mak Office Location: ENG 250 Email: Website: Office Hours: Section 4
More informationCA Compiler Construction
CA4003 - Compiler Construction David Sinclair Overview This module will cover the compilation process, reading and parsing a structured language, storing it in an appropriate data structure, analysing
More informationCMPE 152 Compiler Design
San José State University Department of Computer Engineering CMPE 152 Compiler Design Section 1 (Class) Sections 2 and 3 (Labs) Spring 2019 Course and Contact Information Instructor: Ron Mak Office Location:
More informationIntroduction to Compiler Construction
Introduction to Compiler Construction Robert van Engelen http://www.cs.fsu.edu/~engelen/courses/cop5621 COP5621 Compiler Construction Copyright Robert van Engelen, Florida State University, 2007-2011 Syllabus
More informationLecture : 3. Practical : 2. Course Credit. Tutorial : 0. Total : 5. Course Learning Outcomes
Course Title Course Code WEB DESIGNING TECHNOLOGIES DCE311 Lecture : 3 Course Credit Practical : Tutorial : 0 Total : 5 Course Learning Outcomes At end of the course, students will be able to: Understand
More informationLexical Scanning COMP360
Lexical Scanning COMP360 Captain, we re being scanned. Spock Reading Read sections 2.1 3.2 in the textbook Regular Expression and FSA Assignment A new assignment has been posted on Blackboard It is due
More informationJNTUWORLD. Code No: R
Code No: R09220504 R09 SET-1 B.Tech II Year - II Semester Examinations, April-May, 2012 FORMAL LANGUAGES AND AUTOMATA THEORY (Computer Science and Engineering) Time: 3 hours Max. Marks: 75 Answer any five
More informationCS 44 Exam #2 February 14, 2001
CS 44 Exam #2 February 14, 2001 Name Time Started: Time Finished: Each question is equally weighted. You may omit two questions, but you must answer #8, and you can only omit one of #6 or #7. Circle the
More informationAbout the Tutorial. Audience. Prerequisites. Copyright & Disclaimer. Compiler Design
i About the Tutorial A compiler translates the codes written in one language to some other language without changing the meaning of the program. It is also expected that a compiler should make the target
More informationCompiler Construction Principles And Practice Solution Manual
Compiler Construction Principles And Practice Solution Manual COMPILER CONSTRUCTION PRINCIPLES AND PRACTICE SOLUTION MANUAL PDF - Are you looking for compiler construction principles and practice solution
More informationCOMP9321 Web Application Engineering
COMP9321 Web Application Engineering Semester 2, 2015 Dr. Amin Beheshti Service Oriented Computing Group, CSE, UNSW Australia Week 4 http://webapps.cse.unsw.edu.au/webcms2/course/index.php?cid=2411 1 Extensible
More informationTorben./Egidius Mogensen. Introduction. to Compiler Design. ^ Springer
Torben./Egidius Mogensen Introduction to Compiler Design ^ Springer Contents 1 Lexical Analysis 1 1.1 Regular Expressions 2 1.1.1 Shorthands 4 1.1.2 Examples 5 1.2 Nondeterministic Finite Automata 6 1.3
More informationSRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTER SCIENCE AND ENGINEERING DEPARTMENT OF CSE COURSE PLAN
COURSE CODE COURSE TITLE SEMESTER SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTER SCIENCE AND ENGINEERING : CS0402 DEPARTMENT OF CSE COURSE PLAN : SCRIPTING LANGUAGES AND WEB TECHNOLOGY
More informationIntroduction to the Theory of Computation, Sipser, PWS, ISBN X, 1996
CA320: COMPUTABILITY AND COMPLEXITY 1 1 Introduction CA320 Computability and Complexity Lecturer: Office: L2.55 Phone: 5017 Email: hamilton@computing.dcu.ie WWW: http://www.computing.dcu.ie/ hamilton Course
More informationIntroduction to Compiler Construction
Introduction to Compiler Construction Robert van Engelen http://www.cs.fsu.edu/~engelen/courses/cop5621 COP5621 Compiler Construction Copyright Robert van Engelen, Florida State University, 2005 Syllabus
More informationGujarat Technological University Sankalchand Patel College of Engineering, Visnagar B.E. Semester VII (CE) July-Nov Compiler Design (170701)
Gujarat Technological University Sankalchand Patel College of Engineering, Visnagar B.E. Semester VII (CE) July-Nov 2014 Compiler Design (170701) Question Bank / Assignment Unit 1: INTRODUCTION TO COMPILING
More informationCSE 504: Compiler Design
http://xkcd.com/303/ Compiler Design Course Organization CSE 504 1 / 20 CSE 504: Compiler Design http://www.cs.stonybrook.edu/~cse504/ Mon., Wed. 2:30pm 3:50pm Harriman Hall 116 C. R. Ramakrishnan e-mail:
More informationCSCI312 Principles of Programming Languages!
CSCI312 Principles of Programming Languages!! Chapter 3 Regular Expression and Lexer Xu Liu Recap! Copyright 2006 The McGraw-Hill Companies, Inc. Clite: Lexical Syntax! Input: a stream of characters from
More informationR10 SET a) Explain the Architecture of 8085 Microprocessor? b) Explain instruction set Architecture Design?
Code No: R22054 COMPUTER ORGANIZATION (Com. to CSE, ECC) 1. a) Explain the Architecture of 8085 Microprocessor? b) Explain instruction set Architecture Design? 2. Explain Memory Subsystem Organization
More informationCIS 1.5 Course Objectives. a. Understand the concept of a program (i.e., a computer following a series of instructions)
By the end of this course, students should CIS 1.5 Course Objectives a. Understand the concept of a program (i.e., a computer following a series of instructions) b. Understand the concept of a variable
More informationCompiler Construction Using
Compiler Construction Using Java, JavaCC, and Yacc ANTHONY J. DOS REIS Stale University ofnew York at New Pallz IEEE computer society WILEY A JOHN WILEY & SONS, INC., PUBLICATION Preface xv Chapter 1 Strings,
More informationITT Technical Institute. IT217P Programming in C++ II Onsite Course SYLLABUS
ITT Technical Institute IT217P Programming in C++ II Onsite Course SYLLABUS Credit hours: 4 Contact/Instructional hours: 66 (46 Theory Hours, 20 Lab Hours) Prerequisite(s) and/or Corequisite(s): Prerequisites:
More informationXML. Objectives. Duration. Audience. Pre-Requisites
XML XML - extensible Markup Language is a family of standardized data formats. XML is used for data transmission and storage. Common applications of XML include business to business transactions, web services
More informationWorking of the Compilers
Working of the Compilers Manisha Yadav Nisha Thakran IT DEPARTMENT IT DEPARTMENT DCE,GURGAON DCE,GURGAON Abstract- The objective of the paper is to depict the working of the compilers that were designed
More informationB. Subject-specific skills B1. Problem solving skills: Supply the student with the ability to solve different problems related to the topics
Zarqa University Faculty: Information Technology Department: Computer Science Course title: Programming LAB 1 (1501111) Instructor: Lecture s time: Semester: Office Hours: Course description: This introductory
More informationM. PHIL. COMPUTER SCIENCE (FT / PT) PROGRAMME (For the candidates to be admitted from the academic year onwards)
BHARATHIDASAN UNIVERSITY TIRUCHIRAPPALLI 620 024 M. PHIL. COMPUTER SCIENCE (FT / PT) PROGRAMME (For the candidates to be admitted from the academic year 2007-2008 onwards) SEMESTER I COURSE TITLE MARKS
More informationCS 2210 Sample Midterm. 1. Determine if each of the following claims is true (T) or false (F).
CS 2210 Sample Midterm 1. Determine if each of the following claims is true (T) or false (F). F A language consists of a set of strings, its grammar structure, and a set of operations. (Note: a language
More informationBCS Higher Education Qualifications. Level 6 Web Engineering Syllabus
BCS Higher Education Qualifications Level 6 Web Engineering Syllabus Version 3.0 December 2016 This is a United Kingdom government regulated qualification which is administered and approved by one or more
More informationCS131: Programming Languages and Compilers. Spring 2017
CS131: Programming Languages and Compilers Spring 2017 Course Information Instructor: Fu Song Office: Room 1A-504C, SIST Building Email: songfu@shanghaitech.edu.cn Class Hours : Tuesday and Thursday, 8:15--9:55
More informationLanguages and Automata
Languages and Automata What are the Big Ideas? Tuesday, August 30, 2011 Reading: Sipser 0.1 CS235 Languages and Automata Department of Computer Science Wellesley College Why Take CS235? 1. It s required
More informationSummary of Courses DETAILED SYLLABUS
23 Department of Computer Science & Engineering Dhaka University of Engineering & Technology, Gazipur Gazipur-1700 Summary of Courses 3 rd year 1 st semester Sl. Course Course Title Theory Sessional Credits
More informationSpecifying Syntax COMP360
Specifying Syntax COMP360 The most important thing in the programming language is the name. A language will not succeed without a good name. I have recently invented a very good name and now I am looking
More informationINTRODUCTION PRINCIPLES OF PROGRAMMING LANGUAGES. Norbert Zeh Winter Dalhousie University 1/10
INTRODUCTION PRINCIPLES OF PROGRAMMING LANGUAGES Norbert Zeh Winter 2018 Dalhousie University 1/10 GOAL OF THIS COURSE 2/10 GOAL OF THIS COURSE Encourage you to become better programmers 2/10 GOAL OF THIS
More informationMidterm I (Solutions) CS164, Spring 2002
Midterm I (Solutions) CS164, Spring 2002 February 28, 2002 Please read all instructions (including these) carefully. There are 9 pages in this exam and 5 questions, each with multiple parts. Some questions
More informationMinistry of Higher Education and Scientific Research
Morning Study Department of information technology Institute of Technical - Duhok. University of Polytechnic Duhok. Subject: Web Technology Course book for 2nd year. Lecturer s name: MSc. Ayman Nashwan
More informationOutline. Language Hierarchy
Outline Language Hierarchy Definition of Turing Machine TM Variants and Equivalence Decidability Reducibility Language Hierarchy Regular: finite memory CFG/PDA: infinite memory but in stack space TM: infinite
More informationCompilers. Computer Science 431
Compilers Computer Science 431 Instructor: Erik Krohn E-mail: krohne@uwosh.edu Text Message Only: 608-492-1106 Class Time: Tuesday & Thursday: 9:40am - 11:10am Classroom: Halsey 237 Office Location: Halsey
More informationSCHEME OF STUDIES & EXAMINATIONS Department: Bachelor of Computer Applications 4 th Semester. L T P Theory practical
SCHEME OF STUDIES & EXAMINATIONS Sr. No Course No. Course Title Teaching Schedule of class work Examination L T P Theory practical Credit Exam Duration 1 BCA-202 B Operating System 3 1-25 75-100 4 3 2
More informationCHEME OF EXAMINATION FOR B.Sc. (COMPUTER SCIENCE) SEMESTER SYSTEM (Regular Course) w.e.f Scheme for B.Sc.-III.
CHEME OF EXAMINATION FOR B.Sc. (COMPUTER SCIENCE) SEMESTER SYSTEM (Regular Course) w.e.f. 2015-16 Scheme for B.Sc.-III Semester-V Sr. No. Paper Internal Assessment External Marks Exam Duration 1 Paper-I
More informationUNIT -2 LEXICAL ANALYSIS
OVER VIEW OF LEXICAL ANALYSIS UNIT -2 LEXICAL ANALYSIS o To identify the tokens we need some method of describing the possible tokens that can appear in the input stream. For this purpose we introduce
More informationCompiler Design (40-414)
Compiler Design (40-414) Main Text Book: Compilers: Principles, Techniques & Tools, 2 nd ed., Aho, Lam, Sethi, and Ullman, 2007 Evaluation: Midterm Exam 35% Final Exam 35% Assignments and Quizzes 10% Project
More informationLexical Analysis - 2
Lexical Analysis - 2 More regular expressions Finite Automata NFAs and DFAs Scanners JLex - a scanner generator 1 Regular Expressions in JLex Symbol - Meaning. Matches a single character (not newline)
More information