Muutke küpsiste eelistusi

AWK Programming Language [Kõva köide]

  • Formaat: Hardback, 224 pages, kõrgus x laius x paksus: 100x100x100 mm, kaal: 100 g
  • Ilmumisaeg: 01-Jan-1988
  • Kirjastus: Pearson
  • ISBN-10: 020107981X
  • ISBN-13: 9780201079814
Teised raamatud teemal:
  • Kõva köide
  • Hind: 161,19 €*
  • * saadame teile pakkumise kasutatud raamatule, mille hind võib erineda kodulehel olevast hinnast
  • See raamat on trükist otsas, kuid me saadame teile pakkumise kasutatud raamatule.
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Lisa soovinimekirja
  • Formaat: Hardback, 224 pages, kõrgus x laius x paksus: 100x100x100 mm, kaal: 100 g
  • Ilmumisaeg: 01-Jan-1988
  • Kirjastus: Pearson
  • ISBN-10: 020107981X
  • ISBN-13: 9780201079814
Teised raamatud teemal:
Originally developed by Alfred Aho, Brian Kernighan, and Peter Weinberger in 1977, AWK is a pattern-matching language for writing short programs to perform common data-manipulation tasks. In 1985, a new version of the language was developed, incorporating additional features such as multiple input files, dynamic regular expressions, and user-defined functions. This new version is available for both Unix and MS-DOS. This is the first book on AWK. It begins with a tutorial that shows how easy AWK is to use. The tutorial is followed by a comprehensive manual for the new version of AWK. Subsequent chapters illustrate the language by a range of useful applications, such as: *Retrieving, transforming, reducing, and validating data *Managing small, personal databases *Text processing *Little languages *Experimenting with algorithms The examples illustrates the book's three themes: showing how to use AWK well, demonstrating AWK's versatility, and explaining how common computing operations are done. In addition, the book contains two appendixes: summary of the language, and answers to selected exercises. 020107981XB04062001
Preface.

1. An AWK Tutorial.

Getting Started.
Simple Output.
Fancier Output.
Selection.
Computing with AWK.
Control-Flow Statements.
Arrays.
A Handful of Useful “One-liners.”
What Next?


2. The AWK Lanaguage.

Patterns.
Actions.
User-Defined Functions.
Output.
Input.
Interaction with Other Programs.
Summary.


3. Data Processing.

Data Transformation and Reduction.
Data Validation.
Bundle and Unbundle.
Multiline Records.
Summary.


4. Reports and Databases.

Generating Reports.
Packaged Queries.
A Relational Database System.
Summary.


5. Processing Words.

Random Text Generation.
Interactive Text-Manipulation.
Text Processing.
Summary.


6. Little Languages.

An Assembler and Interpreter.
A Language for Drawing Graphs.
A Sort Generator.
A Reverse-Polish Calculator.
An Infix Calculator.
Recursive-Descent Parsing.
Summary.


7. Experiments with Algorithms.

Sorting.
Profiling.
Topological Sorting.
Make: A File Updating Program.
Summary.


8. Epilog.

AWK as a Language.
Performance.
Conclusion.

Appendix A: AWK Summary.
Appendix B: Answers to Selected Exercises.
Index.
Brian W. Kernighan works in the Computing Science Research Center at Bell Laboratories, Lucent Technologies. He is Consulting Editor for Addison-Wesley's Professional Computing Series and the author, with Dennis Ritchie, of The C Programming Language.

020107981XAB04062001