Isbn: 9783836491501 - processing recursively structured data: a generic approach to parsing and transforming data with a recursive structure, illustrated by a practical implementation (14 resultados)

Condición: New.

Paperback. Condición: New.

Condición: As New. Unread book in perfect condition.

Condición: New.

Paperback. Condición: New.

Condición: New.

Condición: New. In English.

Condición: As New. Unread book in perfect condition.

Kartoniert / Broschiert. Condición: New. 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 .

Taschenbuch. Condición: Neu. Processing Recursively Structured Data | A Generic Approach to Parsing and Transforming Data with a Recursive Structure, Illustrated by a Practical Implementation | Norbert Pfaffinger | Taschenbuch | Kartoniert / Broschiert | Englisch | 2013 | VDM Verlag Dr. Müller | EAN 9783836491501 | Verantwortliche Person für die EU: OmniScriptum GmbH & Co. KG, Bahnhofstr. 28, 66111 Saarbrücken, info[at]akademikerverlag[dot]de | Anbieter: preigu.…

Paperback. Condición: New.

PAP. Condición: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

PAP. Condición: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.…