I'm having to write more and more complex string literals to express the output required.
You're calling two tags which do not nest complex?
Two tags that aren't self-modifying and infinitely recursive?
s@</c>@@;
s@</code>@@;
aXML is RocketBrainf-ck on the complexity scale
Sorry, am I being obtuse?
If only
In reply to Re^19: Is an aXML compiler possible?
by Anonymous Monk
in thread Is an aXML compiler possible?
by Logicus
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |