-
Announcement*
Dear Students the Announcement* has been uploaded for the following topics:</br>Formal Language and Regular Expressions, </br>Regular Expressions , </br>NFA and DFA, </br>NFA to DFA, </br>Conversion of RE to NFA, </br>Languages, Definition Languages , </br> lex tools, </br>Develop a lexical analyzer to recognize a few patterns in C.
-
Resource Link
Dear Students the Resource Link has been uploaded for the following topics:</br>Finite Automata ,NFA and DFA</br>Regular Expression and Context free grammar</br>Introduction to compiler and parsing techniques
-
Resource Link
Dear Students the Resource Link has been uploaded for the following topics:</br>Introduction to compiler design </br>Parsing techniques
-
Lecture Notes
Dear Students the Lecture Notes has been uploaded for the following topics:</br>Context Free grammars and parsing , </br>derivation, parse trees, </br>ambiguity LL(K) grammars , </br>LL(1) parsing Bottom up parsing, </br>, handle pruning, LR parsing, </br>LALR parsing, , </br>parsing ambiguous grammars, , </br>YACC programming specification
-
Question Bank
Dear Students the Question Bank has been uploaded for the following topics:</br> 2 marks and 16 marks questions
-
Puzzles
Dear Students the Puzzles has been uploaded for the following topics:</br>NFA , </br>DFA
-
Assignment
Assignment topic is LMD and RMD Problems and due date is 11-09-2024.
-
Assignment
Assignment topic is LMD and RMD Problems and due date is .
-
Question Bank
Dear Students the Question Bank has been uploaded for the following topics:</br>NFA and DFA Problems, </br>NFA and DFA
-
Youtube Video
Dear Students the Youtube Video has been uploaded for the following topics:</br>Finite Automata </br>Non deterministic finite automata</br>compiler design
-
Lecture Notes
Dear Students the Lecture Notes has been uploaded for the following topics:</br>Formal Language and Regular Expressions, </br>Languages, Definition Languages , </br>NFA and DFA, </br>Regular Expressions , </br>NFA to DFA, </br> lex tools, </br>Applications of Finite Automata to lexical analysis,