pith. sign in

arxiv: 2403.04716 · v1 · pith:E24AFY5Znew · submitted 2024-03-07 · 💻 cs.NI · cs.HC· cs.PL

QRtree -- Decision Tree dialect specification of QRscript

classification 💻 cs.NI cs.HCcs.PL
keywords coderepresentationspecificationdialecteqrtreebytecodeintermediateqrscriptqrtree
0
0 comments X
read the original 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).

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.