Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

scanning and parscing, Lecture notes of System Programming

qedbvwiofbni dicnbdsfiob deifdiovn dfijeidfv difhdi fedihfidh difhdi fdihfdih dfihdf fihdiciosdvh dvhsivis ion

Typology: Lecture notes

2020/2021

Uploaded on 03/28/2022

rahul-kamleshkumar-pithadia
rahul-kamleshkumar-pithadia 🇮🇳

5

(1)

2 documents

1 / 98

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
System Programming
Awadhesh Dixit, Assistant Professor
Information Technology
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e
pf1f
pf20
pf21
pf22
pf23
pf24
pf25
pf26
pf27
pf28
pf29
pf2a
pf2b
pf2c
pf2d
pf2e
pf2f
pf30
pf31
pf32
pf33
pf34
pf35
pf36
pf37
pf38
pf39
pf3a
pf3b
pf3c
pf3d
pf3e
pf3f
pf40
pf41
pf42
pf43
pf44
pf45
pf46
pf47
pf48
pf49
pf4a
pf4b
pf4c
pf4d
pf4e
pf4f
pf50
pf51
pf52
pf53
pf54
pf55
pf56
pf57
pf58
pf59
pf5a
pf5b
pf5c
pf5d
pf5e
pf5f
pf60
pf61
pf62

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