System Programming
Awadhesh Dixit, Assistant Professor
Information Technology
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Guidelines and tips
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community
Ask the community for help and clear up your study doubts
University Rankings
Discover the best universities in your country according to Docsity users
Free resources
Our save-the-student-ebooks!
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
qedbvwiofbni dicnbdsfiob deifdiovn dfijeidfv difhdi fedihfidh difhdi fdihfdih dfihdf fihdiciosdvh dvhsivis ion
Typology: Lecture notes
2020/2021
1 / 98
This page cannot be seen from the preview
Don't miss anything!
Related documents
Partial preview of the text
Download scanning and parscing and more Lecture notes System Programming in PDF only on Docsity!
System Programming
Awadhesh Dixit, Assistant Professor Information Technology
Scanning and Parsing
CHAPTER-
Programming Language Grammars
Some Basics…..
Symbol = 0, 1, a, b, A, B.…. String: Sequence of the symbols… String = a, b, aa, ab, ba, bb, abb….
Regular Expression
- A regular expression is a sequence of characters that define a pattern.
One or More Occurrences Zero or More Occurrences
L1=One or More Occurrences of a=
a
aa
aaaa
aaaaa…..
Infinite …..
a
aaa
Regular Expression
L1 = Zero or More Occurrences of a= a*
aa
aaaa
aaaaa…..
Infinite …..
aaa
a
Regular Expression Examples
Regular Expression Examples
Definition: Finite Automata
- C a, a B a A b
Types of Finite Automata
RE to NFA (Thompson’s construction)
Ex: (a|b)
RE to NFA (Thompson’s construction)
Conversion from NFA to DFA
Subset construction algorithm
OPERATION DESCRIPTION