Andere Kunden interessierten sich auch für
![Formal Languages and Compilation]( "Formal Languages and Compilation")
Formal Languages and Compilation44,99 €![Formal Languages and Compilation]( "Formal Languages and Compilation")
Formal Languages and Compilation57,99 €![Finite Automata, Formal Logic, and Circuit Complexity]( "Finite Automata, Formal Logic, and Circuit Complexity")
Finite Automata, Formal Logic, and Circuit Complexity83,99 €![Finite Automata, Formal Logic, and Circuit Complexity]( "Finite Automata, Formal Logic, and Circuit Complexity")
Finite Automata, Formal Logic, and Circuit Complexity81,99 €![Mathematical Foundations of Computer Science 1975]( "Mathematical Foundations of Computer Science 1975")
Mathematical Foundations of Computer Science 197537,99 €![Programming-Based Formal Languages and Automata Theory]( "Programming-Based Formal Languages and Automata Theory")
Programming-Based Formal Languages and Automata Theory44,99 €![STACS 99]( "STACS 99")
STACS 9983,99 €
This classroom-tested and clearly-written textbook presents a focused guide to the conceptual foundations of compilation, explaining the fundamental principles and algorithms used for defining the syntax of languages, and for implementing simple translators.
This significantly updated and expanded third edition has been enhanced with additional coverage of regular expressions, visibly pushdown languages, bottom-up and top-down deterministic parsing algorithms, and new grammar models.
Topics and features: describes the principles and methods used in designing syntax-directed applications such as parsing and regular expression matching; covers translations, semantic functions (attribute grammars), and static program analysis by data flow equations; introduces an efficient method for string matching and parsing suitable for ambiguous regular expressions (NEW); presents a focus on extended BNF grammars with their general parser and with LR(1) and LL(1) parsers (NEW); introduces a parallel parsing algorithm that exploits multiple processing threads to speed up syntax analysis of large files; discusses recent formal models of input-driven automata and languages (NEW); includes extensive use of theoretical models of automata, transducers and formal grammars, and describes all algorithms in pseudocode; contains numerous illustrative examples, and supplies a large set of exercises with solutions at an associated website.
Advanced undergraduate and graduate students of computer science will find this reader-friendly textbook to be an invaluable guide to the essential concepts of syntax-directed compilation. The fundamental paradigms of language structures are elegantly explained in terms of the underlying theory, without requiring the use of software tools or knowledge of implementation, and through algorithms simple enough to be practiced by paper and pencil.
This significantly updated and expanded third edition has been enhanced with additional coverage of regular expressions, visibly pushdown languages, bottom-up and top-down deterministic parsing algorithms, and new grammar models.
Topics and features: describes the principles and methods used in designing syntax-directed applications such as parsing and regular expression matching; covers translations, semantic functions (attribute grammars), and static program analysis by data flow equations; introduces an efficient method for string matching and parsing suitable for ambiguous regular expressions (NEW); presents a focus on extended BNF grammars with their general parser and with LR(1) and LL(1) parsers (NEW); introduces a parallel parsing algorithm that exploits multiple processing threads to speed up syntax analysis of large files; discusses recent formal models of input-driven automata and languages (NEW); includes extensive use of theoretical models of automata, transducers and formal grammars, and describes all algorithms in pseudocode; contains numerous illustrative examples, and supplies a large set of exercises with solutions at an associated website.
Advanced undergraduate and graduate students of computer science will find this reader-friendly textbook to be an invaluable guide to the essential concepts of syntax-directed compilation. The fundamental paradigms of language structures are elegantly explained in terms of the underlying theory, without requiring the use of software tools or knowledge of implementation, and through algorithms simple enough to be practiced by paper and pencil.
From the reviews:
"One fundamental problem that every compiler should address: namely, translating one formal language to another. This book addresses this fundamental problem in breadth and depth. ... The book is intended as a textbook for graduate and advanced undergraduate students. It succeeds quite well in its goal of addressing the fundamental theory behind the syntax-directed aspect of compilers; hence, it is most suitable for students in a theoretical computer science (CS) program ... ." (MohammadReza Mousavi, ACM Computing Reviews, June, 2009)
"This textbook covers the fundamental concepts of formal languages and compilation. It presents a comprehensive selection of topics and is based on rigorous definitions and algorithms, illustrated by many motivating examples, with a focus on the importance of combining theoretical concepts with practical applications." (Jörg Desel, Zentralblatt MATH, Vol. 1190, 2010)
"One fundamental problem that every compiler should address: namely, translating one formal language to another. This book addresses this fundamental problem in breadth and depth. ... The book is intended as a textbook for graduate and advanced undergraduate students. It succeeds quite well in its goal of addressing the fundamental theory behind the syntax-directed aspect of compilers; hence, it is most suitable for students in a theoretical computer science (CS) program ... ." (MohammadReza Mousavi, ACM Computing Reviews, June, 2009)
"This textbook covers the fundamental concepts of formal languages and compilation. It presents a comprehensive selection of topics and is based on rigorous definitions and algorithms, illustrated by many motivating examples, with a focus on the importance of combining theoretical concepts with practical applications." (Jörg Desel, Zentralblatt MATH, Vol. 1190, 2010)