Processing Recursively Structured Data / Nejlevnější knihy
Processing Recursively Structured Data

Kód: 07047086

Processing Recursively Structured Data

Autor Norbert Pfaffinger

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 a ... celý popis

1420


Skladem u dodavatele
Odesíláme za 9-15 dnů
Přidat mezi přání

Mohlo by se vám také líbit

Darujte tuto knihu ještě dnes
  1. Objednejte knihu a zvolte Zaslat jako dárek.
  2. Obratem obdržíte darovací poukaz na knihu, který můžete ihned předat obdarovanému.
  3. Knihu zašleme na adresu obdarovaného, o nic se nestaráte.

Více informací

Více informací o knize Processing Recursively Structured Data

Nákupem získáte 142 bodů

Anotace knihy

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.

Parametry knihy

Zařazení knihy Knihy v angličtině Computing & information technology Information technology: general issues

1420

Oblíbené z jiného soudku



Osobní odběr Praha, Brno a 47531 dalších

Copyright ©2008-26 nejlevnejsi-knihy.cz Všechna práva vyhrazenaSoukromíCookies


Můj účet: Přihlásit se
Všechny knihy světa na jednom místě. Navíc za skvělé ceny.

Nákupní košík ( prázdný )

Vyzvednutí v Balikovně a PPL
boxech
zdarma nad 1 499 Kč.

Nacházíte se: