Trick | Left Most Derivation | Right Most Derivation | Parse Tree | Ambiguous Grammar| Example.

Подписаться 5 тыс.

Просмотров 6 тыс.

50% 1

#rmd
#rigntmostderivation
#parsetree.
Theory of Automata & Formal Languages
Sr. No Topics Link
1 Introduction and Overview of Theory of Automata and Formal Languages. • TAFL-Lecture-00 | Intr...
2 Automata Theory, Computability Theory ,Complexity Theory • TAFL-Lecture-01 | Auto...
3 Introduction to symbol, alphabet, string, and Language • TAFL-Lecture-02 | Intr...
4 Strings, Trivial & Non-Trivial Substrings ,Prefix and Suffix of string • TAFL-Lecture-04 | Stri...
5 Based on counting Substrings • TAFL -Lecture-08 | TAF...
6 Power of an alphabet • TAFL-Lecture-03 | Powe...
7 Introduction to Deterministic Finite Automata DFA with Real Life Example • TAFL-Lecture-05 | Intr...
8 Introduction to Deterministic Finite Automata DFA with an example of C identifier. • TAFL-Lecture-06 | Intr...
9 Definition of DFA ,NFA and epsilon NFA • TAFL-Lecture-06 | Intr...
10 DFA for Nth symbol from RHS is 1 | Trick in 1 Minute. • DFA for Nth symbol fro...
11 DFA for Nth symbol from LHS is 1. • DFA for Nth symbol fro...
12 Binary Number divisible by 3. • Binary Number divisibl...
13 Nary Number Divisible by K | Binary Number Divisible by 3. • Nary Number Divisible ...
14 Number of 1`s Divisible by 3. • Number of 1`s Divisibl...
15 Length of String divisible by 3. • Length of String divis...
16 Length of String Exactly, At least and Atmost 3 with regular expression. • Length of String Exac...
The remaining videos will be uploaded ASAP
17 CFL to CFG Conversion (Basics) • Part 1- CFL to CFG Con...
18 CFL to CFG Conversion - 10(1+0)*(1+(10)*) • Part 2- CFL to CFG Con...
19 CFL to CFG Conversion • Part 3- CFL to CFG Con...
20 CFL to CFG Conversion L={aibjck|i=j+k} • Part 4- CFL to CFG Con...
21 CFG for Balanced Parentheses • Part 5- (CFG for Balan...
22 CFL to CFG Conversion • Part 6- CFL to CFG Con...
23 Simplification of CFG-Introduction • Part 7- Simplification...
24 Simplification of CFG- Removal of null Production • Part 8- Simplification...
25 Simplification of CFG-Removal of Unit Production • Part 9- Simplification...
26 Simplification of CFG-Removal of Useless Symbol • Part 10- Simplificatio...
The remaining videos will be uploaded ASAP
27 CFG to GNF Conversion Part-1 GNF Introduction • CFG to GNF Conversion ...
28 CFG to GNF Conversion Part-2 • CFG to GNF Conversion ...
29 CFG to GNF Conversion Part-3- (Removal of Left Recursion) • Trick -Removal of Lef...
30 CFG to GNF Conversion Part-4 • CFG to GNF Conversion ...
31 Push Down Automata (PDA) Part-1 • PDA Part-1 -(Theory o...
32 Push Down Automata (PDA) Part-2 • PDA Part-2 -(Theory o...
33 PDA Part-3 -Definition, Operation and Acceptance • PDA Part-3 -Definitio...
34 Push Down Automata (PDA) Part-4- Example-1 • PDA Part-4 -(Theory o...
35 Push Down Automata (PDA) Part-5- Example-2 • PDA Part-5 -(Theory of...
36 PDA Part-6- Odd Length Palindrome • PDA Part-6 -(Odd Lengt...
37 PDA Part-7- Even Length Palindrome • PDA Part-7 -(Even leng...
38 2 Stack PDA part -1 • 2 Stack PDA part -1
39 2 Stack PDA part -2 • #2 Stack PDA Part -2
40 CFG to PDA Part-1 • CFG to PDA Part-1( The...
41 CFG to PDA Part-2 • CFG to PDA Part-2
42 PDA to CFG Part-1 • PDA TO CFGconversion P...
43 Turing Machines Part-1- Definition • #TuringMachine #Turin...
44 Turing Machines Part-2- Transition Diagram • #Turing Machine -Part-...
45 Turing Machines Part-3- Transition Function • #Turing Machine -Part-...
46 Turing Machines Part-4- Transition Table • Turing Machine -Part-4...
47 Turing Machines Part-5- Instantaneous Description • Turing Machine -Part-5...
48 Turing Machines Part-6- Visualization-1 • #Turingmachine #jflap ...
49 Turing Machines Part-6- Visualization-2 • #Turingmachine #jflap ...

Опубликовано:

15 сен 2024

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 16

@Songsz34 10 месяцев назад

Bhai bhai bhai can't thank you huge respect and gratitude towards you bro love you ❤

@vinit-d7q 8 месяцев назад

no one can beat this man for this content hugeeeeeee respect .....🙇🙇🙇🙇

@king_sir924 9 месяцев назад

Thank u so much sir aap bhat simple way me smjha deye ❤😊

@zbeast7872 Месяц назад

you cleared my rmd doubt, thank you sir

@anunawaz7158 Год назад

Nice way to teach maza agya sun kar kal paper hai

@janmejayrao6998 6 месяцев назад

Thanks sir you have easily make me understand 👍🙏

@gauravpandeybca5747 Месяц назад

Thanks sir

@Rajeev_Sanatani 27 дней назад

Sir there is no word to thanks u ..... I have searched full utube but u are the best explainer ❤❤❤

@HridayKumarGupta 27 дней назад

Thanks and welcome

@Rajeev_Sanatani 23 дня назад

@@HridayKumarGupta sir I make parse tree in my exam paper thanks u sir ❤️❤️❤️

@samyakjain9668 2 года назад

Well explained sir 👍

@enjoyable.day1M 3 месяца назад

Huge Respect ❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤

@Fronthub7 Год назад

👍Sir ek video parser (TOC) par bhi banao

@bhilvijayvijay327 9 месяцев назад

Wow I am so surprise you kill the topic in one shot

@honeymavi5587 Год назад

Sir ab iska right most derivation tree kaise banaye ?

@HridayKumarGupta Год назад

There is no RMD tree. RMD and Tree ko mix mat kariye . As you can see in parse tree is like a k-ary tree and in k-ary tree has no left and right child. For ambiguity, just show either (RMD and LMD) or ( two different parse tree ) for same string. If not understood , kindly acknowledge.