Activated Language
Poem (type/paste here - this IS the program)
Each line is transformed by tokens left→right. Every letter A–Z is an opcode. Newlines are preserved.
Output
Single-screen layout. Output is larger for reading.
How the A–Z Parser Works
Per line, scan tokens from left to right. If a token begins with a letter (A–Z), that letter is a command on the entire line. The rest of the token (if any) is its inline argument. Some commands will take the next token as an argument when none is inline.
Argument-hungry letters: a e f h k m p x y consume the next token if their inline arg is empty.
Command reference (A–Z):
aXappend Xbwrap in** **csentence case (Cap first, rest lower)dde-dupe consecutive repeated wordseXerase XfA+Bfind/replace A→BgNglitch (N small random char swaps; default 1)hNhead: keep first N words (default 3)iwrap in* *jjoin/squeeze spaces (collapse whitespace)kXkeep only words containing X (literal)llowermXmark matches of X with brackets[match]nnumber line (1., 2., ...)owrap in[ ]pXprepend Xqquote with>prefixrreverse words (rcharsfor characters)sshuffle (soft swap;s words/swordsfull)tTitle CaseuUPPERvremove vowelswwhisper (spaces →...)xXredact matches of X with XsyNyank: remove word N (default last)zzip repeated letters (aa→a, sss→s)
Examples: u e blood → UPPER then erase “blood” • h4 j → keep first 4 words, squeeze spaces • n q → number and quote the line
No comments:
Post a Comment