Książka Processing Recursively Structured Data Norbert Pfaffinger

Processing Recursively Structured Data

A Generic Approach to Parsing and Transforming Data with a Recursive Structure, Illustrated by a Practical Implementation

Język: Angielski
Oprawa: Miękka
Dostępność: Dostępna u dostawcy
Wysyłamy za 9-15 dni
253.55
Many languages and data structures are of a recursive nature, repeating structures as sub-structures...

Informacje o książce

Język
Angielski
Oprawa
Książka - Miękka
Data wydania
2008
strony
168
EAN
9783836491501
ISBN
3836491508
Enbook ID
07047086
Waga
231
Wymiary
152 x 229 x 9

Pełny opis

Many languages and data structures are of a recursive nature, repeating structures as sub-structures. Arithmetic expressions, virtually all programming languages, and various XML schema definitions are well-known examples. There are several difficulties in writing software operating on such data: For instance, due to stack usage issues it may not be appropriate to use recursive function calls. Furthermore, elaborate solutions are required for efficient memory representations and parsing.§§This book introduces a generic approach applicable to the processing of any kind of data with a recursive structure. The approach allows for a straight-forward implementation of manipulations of such data, including the use of recursive function expressions. At the same time both memory and runtime efficiency are guaranteed, thus supporting the processing of extremely large data instances. The technique relieves programmers from having to care about implementation details such as memory handling.§§The approach is illustrated by a practical implementation and its application in mathematical logic, namely for transformations of various well-known knowledge representation and reasoning tasks. Many languages and data structures are of a recursive nature, repeating structures as sub-structures. Arithmetic expressions, virtually all programming languages, and various XML schema definitions are well-known examples. There are several difficulties in writing software operating on such data: For instance, due to stack usage issues it may not be appropriate to use recursive function calls. Furthermore, elaborate solutions are required for efficient memory representations and parsing.§This book introduces a generic approach applicable to the processing of any kind of data with a recursive structure. The approach allows for a straight-forward implementation of manipulations of such data, including the use of recursive function expressions. At the same time both memory and runtime efficiency are guaranteed, thus supporting the processing of extremely large data instances. The technique relieves programmers from having to care about implementation details such as memory handling.§The approach is illustrated by a practical implementation and its application in mathematical logic, namely for transformations of various well-known knowledge representation and reasoning tasks.

Możesz być zainteresowany

79.35

Sandy Hook

John Schneider
128.33

Trade Unionism

Richard Bell
64.26

Was I Dreaming

Rebecca A Johanson
37.77

Grace2U A Three-Strand Cord

Rev. Judy Reiter Wadding
54.91

Voice of Truth

Neville Earl Walker
113.24
44.49

Curry Leaf Plant

Roby Jose Ciju
79.35
245.96
157.35

City of the Saints

Richard F. Burton
135.63

Renfield

Brian Lee Wilson
64.74
62.89

Clepsydra

Sylvie-Anne Goldberg
229.40
250.73

Legacy of the Lost Pharaoh

Alexander F. Wright
82.47
33.97
57.25

Save the Cat!

Blake Snyder
58.12

Klienci, którzy kupili tę książkę, kupili również

142.06
66.30
54.71

Una Mente Curiosa

Brian Grazer
64.94

TIRANT LO BLANC

JOANOT MARTORELL
75.26

Fabel Und Geschichte

Wilhelm Von Janko
124.73