# QRtree -- Decision Tree dialect specification of QRscript

arXiv: https://arxiv.org/abs/2403.04716 · HTML: https://mlsanity.com/paper/2403.04716/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 7 Mar 2024.

## Built on by (most cited first, 1 of 1)

- [Executable QR codes with Machine Learning for Industrial Applications](https://mlsanity.com/paper/2411.13400/) (2024)

## Abstract (arXiv)

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).