Algorithms, Languages, Automata, and Compilers: A Practical Approach

Front Cover
Jones & Bartlett Publishers, Aug 28, 2009 - Computers - 345 pages
0 Reviews
Algorithms, Languages, Automata, & Compilers A Practical Approach is designed to cover the standard “theory of computing” topics through a strong emphasis on practical applications rather than theorems and proofs. Finite automata, Turing machines, models of computation, complexity, solvability, and other topics that form a foundation of modern programming are discussed -first with a gentle theoretical orientation, and then applied through programming code and practical examples. JFLAP projects and applications are integrated throughout the book, and C# is used for all code.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

PREFACE
CHAPTER 1Regular Languages and Regular Expressions
CHAPTER 2Finite Automata
CHAPTER 3The Relationship Between Finite Automata and Regular Expressions
CHAPTER 4FiniteState Machines in Practice
CHAPTER 5Nonregular Languages and ContextFree Grammars
CHAPTER 6Pushdown Automata
CHAPTER 7Parsing
F
G
H
J
K
M
N
O

CHAPTER 8Compiler Generation
CHAPTER 9The Lindenmayer Systems LSystems
CHAPTER 10Turing Machines
CHAPTER 11Decidability and Complexity
INDEX
B
C
D
E

Other editions - View all

Common terms and phrases

Bibliographic information