- Object IS :
/O O/
- Array IS :
/A A/
- String IS :
/(
)/
- Number IS :
/N
N/
- Object Key IS :
\OK
OK/
- BOOLEAN IS :
/T/
or/F/
- NULL IS :
/NA/
or null - ...
Parsing relies entirely on token generation or any search algorithm, adhering to regular expressions. Fast data processing will be possible thanks to certain rules. The project is currently experimental. Please do not use sample codes in your projects that you will publish.
May require 4% ~ 6% more data size than JSON files.
/O
/KexamplesK/: /A
/O
/Ktag_nameK/: /(a)/,
/KattrK/: /A
/O
/KkeyK/: /(href)/,
/KvalueK/: /(http://amir.saboury.net)/
O/,
/O
/KkeyK/: /(target)/,
/KvalueK/: /(_blank)/
O/
A/
O/,
/O
/Kthis_isK/: /A
/(array)/,
/(of)/,
/(strings)/
A/,
/Knumber_arrayK/: /A
/N1N/,
/N2N/,
/N4N/,
/N8N/,
/N16N/
A/,
/KpieK/: /N3.14N/,
/KbooleanK/: /T/,
/KbugK/: /NA/,
/KmixedK/: /A
/N1N/,
/N2N/,
/O
/Ktest1K/: -1.2345,
/Ktest2K/: /F/
O/,
/NA/,
/N0.4N/,
/A
/(nested)/,
/A
/(array)/,
/T/
A/
A/,
/(end of story!)/
A/
O/,
/O
/KdoneK/: /T/
O/
A/
O/