User:Jdbtwo/sandbox
Appearance
Plain SVG test #1 :
!["Graphical representation of HP Saturn register fields"](http://upload.wikimedia.org/wikipedia/en/thumb/d/d6/HP_Saturn_CPU_register_fields_version_3.0_plain_SVG.svg/847px-HP_Saturn_CPU_register_fields_version_3.0_plain_SVG.svg.png)
![]() | |
Designer | Hewlett Packard |
---|---|
Bits | Hybrid 64-bit GPR, 20-bit address bus, 4-bit datapath, 4-bit minimum word size |
Introduced | 1984 |
Version | "Level 2" |
Design | CISC |
Type | Combination of a Load–store architecture with some exceptions which fall into the Register memory architecture family |
Encoding | Variable |
Branching | Carry bit, "sticky" bit and other flag registers |
Endianness | Little Endian |
Page size | No MMU or paging available |
Extensions | Only extensions for emulated ARM-based "virtual" CPUs |
Open | Proprietary |
Predecessor | Nut |
Registers | |
Nine 64-bit GPR and "scratch" registers, two "data pointer" registers and other miscellaneous registers | |
General-purpose | Four 64-bit GPRs |
Floating point | No FPU registers |
Vector | No vector registers |
User:Jdbtwo/sandbox/Mandel1
User:Jdbtwo/sandbox/Mandel2
!["Graphical representation of HP Saturn register fields"](http://upload.wikimedia.org/wikipedia/commons/thumb/c/ca/HP_Saturn_register_fields_SVG_v.2.svg/847px-HP_Saturn_register_fields_SVG_v.2.svg.png)
SVG test #3 :
!["Graphical representation of HP Saturn register fields"](http://upload.wikimedia.org/wikipedia/commons/e/e0/HP-Saturn-register-fields.png)
!["Graphical representation of HP Saturn register fields"](http://upload.wikimedia.org/wikipedia/commons/thumb/a/a9/HP_Saturn_CPU_register_fields_v.3_SVG.svg/847px-HP_Saturn_CPU_register_fields_v.3_SVG.svg.png)
SVG test #4 :
![](http://upload.wikimedia.org/wikipedia/commons/thumb/2/29/HP_Saturn_registers.svg/220px-HP_Saturn_registers.svg.png)
C Pygments syntax highlighting test #1 :
int a = a+(a+)+1+2+
From the above ( and from perusing the C language portion of the Pygments code ) we see that Pygments in no way really "parses" expressions which creates a problem for languages whose expressions are very complicated, possess many special cases or are very quirky.
The only solution I see is to parse the above expressions with callbacks.