Carte 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

Limbă: engleză
Legare: Carte broșată
Disponibilitate: În depozitul extern
Expediem în 9-15 zile
329.56 lei
Many languages and data structures are of a recursive nature, repeating structures as sub-structures...

Informații despre carte

Limbă
engleză
Legare
Carte - Carte broșată
Publicat
2008
Pagini
168
EAN
9783836491501
ISBN
3836491508
Enbook ID
07047086
Greutate
231
Dimensiuni
152 x 229 x 9

Descriere completă

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.

S-ar putea să te intereseze

103.34 lei

Sandy Hook

John Schneider
168.87 lei

Trade Unionism

Richard Bell
84.43 lei

Was I Dreaming

Rebecca A Johanson
49.44 lei

Grace2U A Three-Strand Cord

Rev. Judy Reiter Wadding
71.18 lei

Voice of Truth

Neville Earl Walker
146.32 lei
58.75 lei

Curry Leaf Plant

Roby Jose Ciju
103.34 lei
322.59 lei
204.47 lei

City of the Saints

Richard F. Burton
177.97 lei

Renfield

Brian Lee Wilson
84.43 lei
81.90 lei

Clepsydra

Sylvie-Anne Goldberg
296.29 lei
327.04 lei

Legacy of the Lost Pharaoh

Alexander F. Wright
106.58 lei
44.18 lei
75.63 lei

Save the Cat!

Blake Snyder
77.05 lei

Clienții care au cumpărat această carte au mai cumpărat și

176.05 lei
82.10 lei
71.39 lei

Una Mente Curiosa

Brian Grazer
85.24 lei

TIRANT LO BLANC

JOANOT MARTORELL
93.33 lei

Fabel Und Geschichte

Wilhelm Von Janko
163.61 lei