Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

QRtree -- Decision Tree dialect specification of QRscript

Stefano Scanzio, Matteo Rosani, Mattia Scamuzzi, Gianluca Cena

TL;DR

This specification will describe an intermediate representation of QRtree, made through a language derived by the three-address code, and define the transformation rules from the intermediate representation to a binary code called eQRtreebytecode.

Abstract

This specification document specifies the syntax and semantics of QRtree, which is a specific dialect of QRscript particularly suited to represent decision trees without chance nodes. The term dialect identifies one of the possible sub-languages that can be encoded inside of an eQR code via QRscript. This specification will describe an intermediate representation of QRtree, made through a language derived by the three-address code. It will then define the transformation rules from the intermediate representation to a binary code. The latter is a binary representation called eQRtreebytecode. These rules can also be applied inversely to transform the eQRtreeBytecode into the intermediate representation. This specification document will pay particular attention to the creation of a compact eQRtreebytecode, as the maximum number of bits that can be stored in a QR code is, at the time of writing, equal to 2953 bytes (in the case of QR code version 40 with a "low" error correction level).

QRtree -- Decision Tree dialect specification of QRscript

TL;DR

This specification will describe an intermediate representation of QRtree, made through a language derived by the three-address code, and define the transformation rules from the intermediate representation to a binary code called eQRtreebytecode.

Abstract

This specification document specifies the syntax and semantics of QRtree, which is a specific dialect of QRscript particularly suited to represent decision trees without chance nodes. The term dialect identifies one of the possible sub-languages that can be encoded inside of an eQR code via QRscript. This specification will describe an intermediate representation of QRtree, made through a language derived by the three-address code. It will then define the transformation rules from the intermediate representation to a binary code. The latter is a binary representation called eQRtreebytecode. These rules can also be applied inversely to transform the eQRtreeBytecode into the intermediate representation. This specification document will pay particular attention to the creation of a compact eQRtreebytecode, as the maximum number of bits that can be stored in a QR code is, at the time of writing, equal to 2953 bytes (in the case of QR code version 40 with a "low" error correction level).
Paper Structure (32 sections, 12 figures, 3 tables)

This paper contains 32 sections, 12 figures, 3 tables.

Table of Contents

  1. Scope
  2. Conformance
  3. Normative References
  4. Overview
  5. QRScript and Dialects
  6. QRtree dialect
  7. Data types
  8. String: ASCII-7, UTF-8 and DICT
  9. Integer: INT16 and INT32
  10. Real: FP16 and FP32
  11. QRtree header
  12. HEADER_END (000)
  13. INT_TYPE (001) and FLOAT_TYPE (010)
  14. DICT_TYPES (011)
  15. DICT_SPEC_TYPE (100)
  16. ...and 17 more sections

Figures (12)

  • Figure 1: Chain of usage of eQR code technology (generation and execution phases)
  • Figure 2: Binary format of the eQR code (i.e., QRbytecode)
  • Figure 4: Example of interaction between the user and the application executing the eQR code
  • Figure 5: Conversion of input instruction to QRtreeBytecode
  • Figure 6: Conversion of inputs instruction to QRtreeBytecode
  • ...and 7 more figures