Download presentation

Presentation is loading. Please wait.

Published byRegina Lyons Modified over 4 years ago

1
©2004 Brooks/Cole FIGURES FOR CHAPTER 2 SCANNING Click the mouse to move to the next page. Use the ESC key to exit this chapter. This chapter in the book includes: 2.1The Scanning Process 2.2Regular Expressions 2.3Finite Automata 2.4From Regular Expressions to DFAs 2.5Implementation of a TINY Scanner 2.6Use of Lex to Generate a Scanner Automatically Exercises Programming Exercises Notes and References

2
©2004 Brooks/Cole 2.1 The Scanning Process, page 34 (1)

3
©2004 Brooks/Cole 2.1 The Scanning Process, page 34 (2)

4
©2004 Brooks/Cole Figure 2.1: A finite automaton for identifiers

5
©2004 Brooks/Cole 2.3 Finite Automata, page 49 (1)

6
©2004 Brooks/Cole 2.3 Finite Automata, page 49 (2)

7
©2004 Brooks/Cole Figure 2.2: A finite automaton for identifiers with error transitions

8
©2004 Brooks/Cole 2.3 Finite Automata, Example 2.6

9
©2004 Brooks/Cole 2.3 Finite Automata, Example 2.7

10
©2004 Brooks/Cole 2.3 Finite Automata, Example 2.8 (1)

11
©2004 Brooks/Cole 2.3 Finite Automata, Example 2.8 (2)

12
©2004 Brooks/Cole 2.3 Finite Automata, Example 2.8 (3)

13
©2004 Brooks/Cole Figure 2.3: A finite automaton for floating-point numbers

14
©2004 Brooks/Cole 2.3 Finite Automata, Example 2.9

15
©2004 Brooks/Cole Figure 2.4: A finite automaton for C-style comments

16
©2004 Brooks/Cole Figure 2.5: Finite automaton for an identifier with delimiter and return value

17
©2004 Brooks/Cole 2.3 Finite Automata, page 54

18
©2004 Brooks/Cole 2.3 Finite Automata, page 55 (1)

19
©2004 Brooks/Cole 2.3 Finite Automata, page 55 (2)

20
©2004 Brooks/Cole 2.3 Finite Automata, page 55 (3)

21
©2004 Brooks/Cole 2.3 Finite Automata, page 56 (1)

22
©2004 Brooks/Cole 2.3 Finite Automata, page 56 (2)

23
©2004 Brooks/Cole 2.3 Finite Automata, page 56 (3)

24
©2004 Brooks/Cole 2.3 Finite Automata, page 57 (1)

25
©2004 Brooks/Cole 2.3 Finite Automata, page 57 (2)

26
©2004 Brooks/Cole 2.3 Finite Automata, Example 2.10 (1)

27
©2004 Brooks/Cole 2.3 Finite Automata, Example 2.10 (2)

28
©2004 Brooks/Cole 2.3 Finite Automata, Example 2.11 (1)

29
©2004 Brooks/Cole 2.3 Finite Automata, Example 2.11 (2)

30
©2004 Brooks/Cole 2.3 Finite Automata, page 59

31
©2004 Brooks/Cole 2.4 From Regular Expressions to DFAs, page 64 (1)

32
©2004 Brooks/Cole 2.4 From Regular Expressions to DFAs, page 64 (2)

33
©2004 Brooks/Cole 2.4 From Regular Expressions to DFAs, page 65 (1)

34
©2004 Brooks/Cole 2.4 From Regular Expressions to DFAs, page 65 (2)

35
©2004 Brooks/Cole 2.4 From Regular Expressions to DFAs, page 65 (3)

36
©2004 Brooks/Cole 2.4 From Regular Expressions to DFAs, page 66 (1)

37
©2004 Brooks/Cole 2.4 From Regular Expressions to DFAs, page 66 (2)

38
©2004 Brooks/Cole 2.4 From Regular Expressions to DFAs, page 66 (3)

39
©2004 Brooks/Cole 2.4 From Regular Expressions to DFAs, Example 2.12 (1)

40
©2004 Brooks/Cole 2.4 From Regular Expressions to DFAs, Example 2.12 (2)

41
©2004 Brooks/Cole Figure 2.8: NFA for the regular expression ab|a using Thompson’s construction

42
©2004 Brooks/Cole 2.4 From Regular Expressions to DFAs, Example 2.13 (1)

43
©2004 Brooks/Cole 2.4 From Regular Expressions to DFAs, Example 2.13 (2)

44
©2004 Brooks/Cole 2.4 From Regular Expressions to DFAs, Example 2.14

45
©2004 Brooks/Cole Figure 2.9: NFA for the regular expression letter(letter|digit) * using Thompson’s construction

46
©2004 Brooks/Cole 2.4 From Regular Expressions to DFAs, Example 2.14

47
©2004 Brooks/Cole 2.4 From Regular Expressions to DFAs, Example 2.15

48
©2004 Brooks/Cole 2.4 From Regular Expressions to DFAs, Example 2.16 (1)

49
©2004 Brooks/Cole 2.4 From Regular Expressions to DFAs, Example 2.16 (2)

50
©2004 Brooks/Cole 2.4 From Regular Expressions to DFAs, Example 2.17 (1)

51
©2004 Brooks/Cole 2.4 From Regular Expressions to DFAs, Example 2.17 (2)

52
©2004 Brooks/Cole 2.4 From Regular Expressions to DFAs, page 73 (1)

53
©2004 Brooks/Cole 2.4 From Regular Expressions to DFAs, page 73 (2)

54
©2004 Brooks/Cole 2.4 From Regular Expressions to DFAs, Example 2.18

55
©2004 Brooks/Cole 2.4 From Regular Expressions to DFAs, Example 2.19 (1)

56
©2004 Brooks/Cole 2.4 From Regular Expressions to DFAs, Example 2.19 (2)

57
©2004 Brooks/Cole 2.5 Implementation of a TINY Scanner, page 76 (1)

58
©2004 Brooks/Cole 2.5 Implementation of a TINY Scanner, page 76 (2)

59
©2004 Brooks/Cole Figure 2.10: DFA of the TINY scanner

60
©2004 Brooks/Cole Chapter 2, Exercise 2.16 (a)

61
©2004 Brooks/Cole Chapter 2, Exercise 2.16 (b)

Similar presentations

© 2019 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google