Thanks to: https://github.com/matslina/awib
# This is the awib frontend
# Please refer to the documentation in the full source distribution
# of awib for details regarding this file
## Phase 1
## Target identification
##
% *T     (where T = index of target platform)
# read bytes until EOF or bf instruction or '@' is reached
>>>>+[>[-],+
% T 0 0 0 1 *inc(X) 0 0 0  (where X is byte read)
[->+>+<<]>>[-<<+>>]+<
% T 0 0 0 1 inc(X) *inc(X) 1 0
[-[>+++++[-<------->]+<-[-[-[-[--------------[--[-->>+<<[>>-<++
[-<--------->]+<[--[>+++++++++[-<++++++++++>]<[-]]]]]]]]]]]<->]
>[-<<<->>>]<<<]
% T 0 0 0 *0 X 0 0 d
% if( X=='@' ) d=1 else if(EOF) X=0 else X = a bf instruction
# if '@' was encountered then read a string at most 20 bytes long
# whitespace and EOF and bf all terminate the string when read
>>>>[->++++++++++++++++++++<<<<[-]>>>+[
% T 0 0 0 0 (target) 0 0 0 *1 C (where C = sub(20 strlen(target)))
-<,+[-<+<+>>]+<<->
% T 0 0 0 0 (target) X *X 1 0 C
[-[---------[-[---[>++++[-<---->]+<+[-----------[-[-[-[--------------
[--[>++[-<--------->]+<--[--[>+++++++++[-<++++++++++>]<[-]]]]]]]]]]]]]]]
+>[-<->]
% T 0 0 0 0 (target) X c *0 0 C (where c=(X EOF or bf or whitespace ? 0 : 1))
>>[->+<]
<<<[->>>+>->+<[>-]>[>]<[-<<->>]<<<<<]>>>
% T 0 0 0 0 (target) X 0 0 0 *c D
% where c=(string terminated ? 0 : 1) and D=(c==1 ? sub(C 1) : C)
]
# if string was ended due to strlen exceeding limit then read one char extra
+>[<-]<[<]>[-<<<,>>>>]
% T 0 0 0 0 (target) X 0 0 0 *0 D
# now check if the read target string matches any known target string
# and overwrite the target index T accordingly
# we take care not to overwrite the last read X as it may be bf and should
# be passed on to the bytecode compiler below
<<<<+[->+<]>[-<<[<]<<<+>>>>[>]>]++++++++++++++++++++>>>>[-<<<<->>>>]<<<++++++++
<<<[<]<<<->>>>[>]>>
% T X 0 0 0 (target) 0 s *8 0 0   (where s = strlen(target))
[[->+>+<<]>[-<+>]+>-[-[-[-[-[-[-[-[<->[-]]
<[-
# build target string for backend index 8
% T X 0 0 0 (target) 0 s 8 *0 0
>+++++++++[->+>++++++++++++<<]>>[->+>+>+>+>+>+>+>+>+<<<<<<<<<]
>>----------->++>----->------------->-->----------->++++++++++>-----------
<<<<<<<<<<<<
% T X 0 0 0 (target) 0 s 8 *0 0 9 0 "lang_java" 0
]>]
<[-
# build target string for backend index 7
% T X 0 0 0 (target) 0 s 7 *0 0
>+++++++++[->+>++++++++++++<<]>->[->+>+>+>+>+>+>+>+<<<<<<<<]>>----------->++
>----->------------->++++++++>---------
<<<<<<<<<<
% T X 0 0 0 (target) 0 s 7 *0 0 8 0 "lang_tcl" 0
]>]
<[-
# build target string for backend index 6
% T X 0 0 0 (target) 0 s 6 *0 0
>+++++++++[->+>++++++++++++<<]>>[->+>+>+>+>+>+>+>+>+<<<<<<<<<]>>----------->++
>----->------------->++++++>+++++++++>---------->+++++++++++++
<<<<<<<<<<<<
% T X 0 0 0 (target) 0 s 6 *0 0 9 0 "lang_ruby" 0
]>]
<[-
# build target string for backend index 5
% T X 0 0 0 (target) 0 s 5 *0 0
>+++++++++++[->+>++++++++++<<]>>[->+>+>+>+>+>+>+>+>+>+>+<<<<<<<<<<<]
>-->------------->>------->--------------->++>+++++++++++>++++++>------>+
<<<<<<<<<<<<<
% T X 0 0 0 (target) 0 s 5 *0 0 11 0 "lang_python" 0
]>]
<[-
# build target string for backend index 4
% T X 0 0 0 (target) 0 s 4 *0 0
>>+++++++[->+++++++<]+++++++>
[->++>++>++>++>++>++>++<<<<<<<]>
++++++++++>->++++++++++++>+++++>--->+++++>+++++++++++++
<<<<<<<<<<
% T X 0 0 0 (target) 0 s 4 *0 0 7 0 "lang_go" 0
]>]
<[-
# build target string for backend index 3
% T X 0 0 0 (target) 0 s 3 *0 0
>>+++++++[->+++++++<]++++++++++>
[->++>++>++>++>++>++>++>++>++>++<<<<<<<<<<]>
++++++++++>->++++++++++++>+++++>--->++>+++++++++++++++++++>+++++++++++>
+++++++++++>+++++++++++++++++++++++<<<<<<<<<<<<<
% T X 0 0 0 (target) 0 s 3 *0 0 10 0 "lang_dummy" 0
]>]
<[-
# build target string for backend index 2
% T X 0 0 0 (target) 0 s 2 *0 0
>>+++++++[->+++++++<]++++++>[->++>++>++>++>++>++<<<<<<]
>++++++++++>->++++++++++++>+++++>--->+<<<<<<<<<
% T X 0 0 0 (target) 0 s 2 *0 0 6 0 "lang_c" 0
]>]
<[-
# build target string for backend index 1
% T X 0 0 0 (target) 0 s 1 *0 0
>>+++++++[->+++++++<]+++++++++>[->+>+>+>++>++>++>++>++>++<<<<<<<<<]
>++>+++++++>+++++>--->++++++++++>+++++++>++++++++++++>+++
++++++++++++++++>++++++++++++++++++++++<<<<<<<<<<<<
% T X 0 0 0 (target) 0 s 1 *0 0 9 0 "386_linux" 0
]
% T X 0 0 0 (target) 0 s i *0 0 S 0 (string) 0
% where S = strlen(string) and i is the backend index of the target (string)
# if (target) equals (string) then set T=i and break else decrease s and retry
<<[->>+>>-<<<<]>>[-<<+>>]>+>[<++++[->++++<]>[-]]<
% T X 0 0 0 (target) 0 s i 0 *e 0 0 (string) 0  (where e=(S==s ? 1 : 0))
[-
<+<<<<[<]>
% T X 0 0 0 *(target) 0 s i 1 0 0 0 (string) 0
[
% T X 0 (target) 0 0 *(F target) 0 s i c 0 (1sled) 0 0 (G string) 0
% where c = (strings equal so far ? 1 : 0 ) and (1sled) is a (initially empty)
% sequence of cells holding 1 and F/G first cells of respective block
[-<+<+>>]<[>>[>]>>>>>[>]>+>[<-]<[<]>[-<<[<]<[-]<<<<[<]<[-]+>>[>]>>>>>[>]>>+<]>-<<<[<]<<<<<[<]<-]
% T X 0 (target F) *0 0 (target) 0 s i c 0 (1sled) 0 0 sub(G F) (string) 0
>>[>]>>>>>[>]>>[[-]<<<[<]<[-]>>[>]>>]<<+[<]<<<<<[<]>
% T X 0 (target F) 0 0 *(target) 0 s i c 0 (1sled) 1 0 0 (string)
]
% T X 0 (target) 0 0 *0 s i c  0 (1sled) 0
<<<[[->>+<<]<]>>>[>]>>>>>[>]<[-<]<
% T X 0 0 0 (target) 0 s i *c  0
# if c==1 then we have a match and write T=i and set i=1
[-<<<<[<]<<<<[-]>>>>>[>]>>[-<<<[<]<<<<+>>>>>[>]>>]+>]>
% T X 0 0 0 (target) 0 s i 0 *0
]
# remove (string) if string lengths didn't match and then sub 1 from i
>>>[>]<[[-]<]<<
<<-]
% T X 0 0 0 (target) 0 s *0 0 0
<[-]<<[[-]<]<<<+[->>>>+<<<<]>>>>->>>
% T 0 0 0 0 X 0 0 *0
]
% T 0 0 0 0 X 0 0 *0
<<<+[->>>>>>>+<<<<<<<]>>>>>>>-
% T 11(0) *X 0 0
## Phase 2
## Bytecode compilation
##
% T 11(0) *X    (where X is user input)
# if read char X is not EOF then enter main loop
+[[-<+>]>+<]>[-<<->>]<<
[
% T 8(0) (code) 0 0 *X (cells left of code ignored for a while hereafter)
# check if X is brainfuck
[->+>+<<]>[-<+>]++++++[->-------<]+>-
[-[-[-[--------------[--[<+++[->-----
--<]+>-[--[<->>+++++++[-<++++++++++++
+>]<++[-]]]]]]]]]<<
% (code) 0 0 *X isbf(X) 0 0
# if bf then add to bytecode
>[-
++++++[-<------->]+<
% (code) 0 0 *sub(X 42) 1 0 0
[-[-[-[-[--------------[--[-----------------------------[
# CLOSING BRACKET
# if this closes OPEN SUB(1) or OPEN ADD(1) then overwrite with SET(0)
# else append CLOSE
--<<
+<<<<-------[>>>>-]>>>>[>>>>]<<<<<<<<+++++++>>>>
% (code) P i Q j *c 0 0 1 0   (where c = (P(i) == OPEN(0)))
[<<---[>>-]>>[>>]<<[->>>>+<<<<]+
 << ++[>>-]>>[>>]<<[->>>>+<<<<]<<+>>>>>>
 % (code) OPEN 0 Q j 0 0 0 1 *d   (where d = (Q == ADD or Q == SUB))
 [-<<<<+<-[>-]>[>]<<+>
  % (code) OPEN 0 Q j *e 0 0 1 0   (where e = (j == 1) == overwrite SET(0))
  [->>>-<<<<-<[-]<<++>>]>>>>]<<<<]>
% (code) 0 *0 0 f 0    (where f = 1 if append CLOSE)
>>[-<<<++++++++>>>>>]<<
% (code) CLOSE()/SET(0) 0 *0 0 0
]
# OPENING BRACKET
# if previous op was SET(0) or CLOSE or if this is the first op
# then ignore this loop
>[-
% (code) 0 0 0 *0 0 0
+++<<<<<
[>>>>>-<<<<<[->>>+<<<]]>>>
--------[++++++++[-<+>]<-------->>>-<<]<
-[+++++++++[-<<+>>]<<--------->>>>>-<<<]<<+++++++++>>
+<[>-]>[>]<[->>>[-<+>]<<<]>>>[-]<<<+++++++>>
% (code) OPEN *c 0 0 0 (where c = (should this loop be ignored ? 1 : 0))
[[-]+>>>>>+<<<<<[
% (code) OPEN *1 0 0 0 L l
>>+<,[>-]>[>]<[-<<->>]+<+[>-]>[>]<[-<<->>]<-
% (code) OPEN c *X 0 0 L l  (where c = (EOF reached ? 0 : 1) and X = byte read)
>+++++++++[-<---------->]+<-[>-]>[>]<[->>
{ 16b inc >>>++++++++[-<++++++++>]<[->++++<]<
          [->+>-<<]>+[-<+>]+>-[<->[-]]<[-<[-]<+>>]<< }
<<]+<--[>-]>[>]<[->>
{ 16b dec >>+<[>-<[->>+<<]]>>[-<<+>>]<<->[-<+
          <->++++++++[->++++++++<]>[-<++++>]<->]<< }
<<]+++++++++[-<++++++++++>]<++++[-]
>>>
{ 16b iszero >>+<[>-]>[>]<<<[[->>>+<<<]>>[-]<<]>>>[-<<<+>>>]<<< }
# if Ll=0 then delete OPEN and set c=0 to break
>>[-<<<<<<[-]<<------->>>>>>]<<<<<<
]]
% (code) *0 0 0 0 L l  (where Ll is nonzero iff EOF occurred prematurely)
>>>>[-]>[-]<<<
% (code) 0 0 *0 0
]<]
# MOVE RIGHT
# if previous op is RIGHT(i) and i is not 255 then overwrite with RIGHT(inc(i))
# else append RIGHT(1)
>[
-<<<<<[->>+>+<<<]>>[-<<+>>]<[->+>>+<<<]>[-<+>]
% (code) *0 P i 0      (where P(i) = previous op)
++++++++++++++++[->>----------------<<]>>+
[<<++++++++++++++++[->>++++++++++++++++<<]+>>[-]]<------[<[-]>++++++[-]]
<[->>+<<]++++++>+>[-<-<------<+>]>>
]<
% (code) RIGHT(?) 0 *0 0 0
]
# MOVE LEFT
# if previous op is LEFT(i) and i is not 255 then overwrite with LEFT(inc(i))
# else append LEFT(1)
>[
-<<<<<[->>+>+<<<]>>[-<<+>>]<[->+>>+<<<]>[-<+>]
% (code) *0 P i 0      (where P(i) = previous op)
++++++++++++++++[->>----------------<<]>>+
[<<++++++++++++++++[->>++++++++++++++++<<]+>>[-]]<-----[<[-]>+++++[-]]
<[->>+<<]+++++>+>[-<-<-----<+>]>>
]<
% (code) LEFT(?) 0 *0 0 0
]
# OUTPUT
>[
<<<++++>>>->
]<
% (code) OUTPUT 0 *0 0 0
]
# SUB
#if previous op is SUB(i)
#   if i is 255 then remove previous op
#   else overwrite with SUB(inc(i))
#else append SUB(1)
>[
-<<<<<[->>+>+<<<]>>[-<<+>>]<[->+>>+<<<]>[-<+>]
% (code) *0 P i 0        (where P(i) = previous op)
>---[<+++>+++[-]+>[-]>]>
[<++++++++++++++++[->----------------<]>+>+<
[<<<+>>++++++++++++++++[->++++++++++++++++<]>[-]>-<]
>[-<<<<[-]<--->>>]<]
 ]<
% (code) SET/SUB(?) 0 *0 0 0
]
# INPUT
>[
<<<++>>>->
]<
% (code) INPUT 0 *0 0 0
]
# ADD
#if previous op is ADD(i)
#   if i is 255 then remove previous op
#   else overwrite with ADD(inc(i))
#else append ADD(1)
>[
-<<<<<[->>+>+<<<]>>[-<<+>>]<[->+>>+<<<]>[-<+>]
% (code) *0 P i 0        (where P(i) = previous op)
>-[<+>+[-]+>[-]>]>
[<++++++++++++++++[->----------------<]>+>+<
[<<<+>>++++++++++++++++[->++++++++++++++++<]>[-]>-<]
>[-<<<<[-]<->>>]<]
]<
% (code) ADD(?) 0 *0 0 0
]
# Cancellation
% (code P i Q j) 0 *0   (where P(i) and Q(j) are the two most recent ops)
# if P/Q in (LEFT/RIGHT RIGHT/LEFT ADD/SUB SUB/ADD) and j == 1
#    remove Q(j) and decrement i
#    if dec(i) == 0 then remove P(i)
>>+<<<+<-[>-]>[>]<<+>[
 # j == 1
 % P i Q 1 *1 0 0 1
 <<<[>>-]>>[>>]<<[->-<]+>[-
  # i != 0
  <-<[->+<<<+>>]
  % add(P Q) i *0 Q 0 0 0 1
  +<<----[>>-]>>[>>]<<[->>>+<<<]+<<-------[>>-]>>[>>]<<[->>>+<<<]
  >[-<+<<->>>]+<<<+++++++++++>>>>>
  % P i Q 1 0 *c 0 1  (where c = add(P Q) in (add(LEFT RIGHT) add(ADD SUB)))
  [->>-<<<<-<[-]+<-[>-]>[>]<[-<<[-]]>]<]]>>>
% (code) 0 0 0 *z    (where z = 1 if we should attempt further optimizations)
#if P in (ADD SUB) and Q == SET then remove P
[>+<-<<<+<<---------[>>-]>>[>>]<<[
  # Q == SET
  >>>>-<<<<
  -<<+<<-[>>-]>>[>>]<<[->>>+<<<]+<<--[>>-]>>[>>]<<[->>>+<<<]<<+++>>>>>
  % P i 0 j 0 *c 0 0 0   (where c = P in (ADD SUB))
  [-<<<<<[-]>[-]>>[-<<+>>]]<]<<+++++++++>>>>>]
% (code) 0 0 0 *0 z  (where z = 1 if we should attempt further optimizations)
# if P == SET and Q(j) in (ADD(1) SUB(1)) then inc/dec i and remove Q(j)
+>[-
<<<<+<<<<---------[>>>>-]>>>>[>>>>]<<<<<<<<+++++++++>>>>[
 # P == SET
 % 9 i Q j *1 0 0 1 0
 <-[>-]>[>]<<+>[
  # j == 1
  <<-[>>-]>>[>>]<<<<+>>[-
   # Q == ADD
   >>>-<<<<-<<<+++++++[->----------------<]>+[>-]>[>]+<[->-<]>
   [-<++++++++++++++++[-<++++++++++++++++>]>]
   <<<+++++++++>>]
  +<<---[>>-]>>[>>]<<<<+++>>[-
   # Q == SUB
   >>>-<<<<-<--
   <[>-]>[>]<[+++++++++++++++[-<++++++++++++++++>]]<->
]]]>>>>]<
% (code) 0 0 0 *z 0  (where z = 1 if we should attempt further optimizations)
# if P == CLOSE then try the copy loop optimization
[
 -<<<+<<--------[>>-]>>[>>]<<<<++++++++>>[# P == CLOSE
  ->>>>>>>++++++++<<++++++++[-<++++++++++++++++>]<-[-<+<+>>]
  <<<<<+<-------
  % (code) Q j *1 1 0 0 128 128 *0 0 0 P
  <<[>>-]>>[>>]<<[->-<]>[-<+>]<
  [ # determine if loop can be optimized
   % (code) *k 0 0 0 l r a 0 0 (code)
   % where k = 1 iff next op should be inspected
   %       l = sub(127 num_left)
   %       r = sub(127 num_right)
   %       a = 1 iff SUB(1) on cell 0 processed
   <<-[>>-]>>[>>]<<[# P == ADD
    >>>>[->->>+<<<]+>[<-]<[<]>[ # l == r: kill l ->>>[-<<+>>]<<<]
    >>>[-<<+<+>>>]<<<<<<+<-]+
   <<--[>>-]>>[>>]<<[# P == SUB
    >>>>[->->>+<<<]+>[<-]<[<]>[ # l == r
     >>[<<-]<<[<<]>+>[-<<<<<-[>-]>[>]<<+>[->>>->>>+<<<<<<]+>>>>]
     <[->>>>[-<<+>>]<<<<]>]
     >>>[-<<+<+>>>]<<<<<<+<-]+
   <<--[>>-]>>[>>]<<[# P == LEFT
    -<[->+>>>+>-[<-]<[<]>[-<<<<[->+<]>>>>]<<<<]>[-<+>]>+<]+
   <<-[>>-]>>[>>]<<[ # P == RIGHT
    -<[->+>>>+>>-[<<-]<<[<<]>>[-<<<<[->+<]>>>>]<<<<]>[-<+>]>+<]
   % (code) sub(P 6) i *0 q 0 0 l r a 0 0 (code) 0
   % where q = P in (ADD SUB LEFT RIGHT)
   # keep going if q==1 && l!=0 && r!=0 && next op exists
   <[->>>>>>>>>+<<<<<<<<<]<++++++[->>>>>>>>>+<<<<<<<<<]
   +<<[>>->>>+<<<]>>[>>]<<[-]>>>>>>
   [[-<<+>>]>[[-<<+>>]<<<<+>>>>]<]>[-<<+>>]>[-<<+>>]<<<<<
   ---[<<<->>>+++[-]]<<<+
   % (code) *k 0 0 0 l r a 0 0 P i (code)
  ]
  >>>>>>>>+>-------[<-]<[<]>>+++++++
  <<<[->>+<<]+<<[-<+>>-<]>[>-]>[>]<[->>+<<]>+>---[<-]<[<]>>+++[-]
  <<<<<[->>+<<]>>[-]>+>
  % (code) 0 0 0 0 0 0 1 *w 0 (loop)
  % where w = 1 iff copy loop optimization can be applied
  [<->->>[-]>[-]<<<<<<<<<+>+>+>+>+>>>>>>
   [ # replace loop with LMUL/RMUL
    % (code) 0 1 ::: 1 0 0 n d 0 *P i (loop)
    % where d = offset to current cell
    %       n = 1 iff offset is negative
    <+>-[--[--[-[++++++[-]<->]<[ # RIGHT(i)
     ->>[<<+<[>-]>[>]<[-<<[-]>>]<+>>>-]<<
    ]>]<[ # LEFT(i)
     ->>[<<+<[>-]>[>]<[-<<[-]+>>]<->>>-]<<
    ]>]<[ # SUB(i)
     % (code) 0 1 ::: 1 0 0 n d *1 0 i (loop)
     <[>-]>[>]+<[->-<]>[ # d != 0
      +++++++++++++++[-<<<<++++++++++++++++>>>>]>[-<<<<<->>>>>]<]<
     % (code) 0 1 ::: 1 0 sub(256 i) n d *0 0 0 (loop)
    ]>]<[ # ADD(i)
     % (code) 0 1 ::: 1 0 0 n d *1 0 i (loop)
     <[>-]>[>]+<[->-<]>[ # d != 0
      ->[-<<<<<+>>>>>]<]<
     % (code) 0 1 ::: 1 0 i n d *0 0 0 (loop)
    ]
    % (code) 0 1 ::: 1 0 y n d *0 0 i (loop)
    % where y!=0 iff MUL op should be appended to code
    %       and y is the second op argument
    <<<[ # y!=0
     <+>>[ # n=1 so d negative
      <<-<[<]++++++++++>->++++++++++>->->[>]
      >>>[+<<<<[<]<<<+>>>>[>]>>>>>-<<]>+<<-]
     <<[ # n=0 so d positive
      -<[<]++++++++++++>->++++++++++++>->->[>]
      >>>[->>+<<<<<<[<]<<<+>>>>[>]>>>]
      <<<]
     >[-<<[<]<+>>[>]>]
     % (code) LMUL/RMUL y 0 1 ::: 1 0 *0 0 0 n d 0? (loop)
    ]
    % (code) 0 1 ::: 1 0 *0 n d 0 0 i (loop)
    >[>[+>>-<<]>+<<-]>[->>+<<]
    <<+<+>>>>>>>
    % (code) 0 1 ::: 1 0 0 n d 0 *(loop)
   ]
   % (code) 0 1 ::: 1 0 0 n 0 0 *0
   <<<[-]<<<[-<]+++++++++>>>>>>>>>
   % (code) SET(0) 0 0 0 0 0 0 0 *0
  ]
  % (code) 0 0 0 0 0 0 v *0 0 (loop)
  % where v = 1 iff copy loop optimization was not applied
  <[->>>[[-<<<<<<<<<+>>>>>>>>>]>[-<<<<<<<<<+>>>>>>>>>]>]
    <<<]<<<<<<
  ]>>>
 % (code) 0 0 0 *0 0
 ]
]
% 8(0) (code) 0 0 X *0    (where X may be the last byte read)
# read next byte and and break if EOF
<[-]>
,+[[-<+>]>+<]>[-<<->>]<<
]
<<<<[<<]
% 6(0) *0 0 (code)
## Phase 3
## Code verification
##
# move code leftwards and ensure that all OPEN/CLOSE are balanced
# in the process we calculate the maximum loop (ie OPEN/CLOSE) depth
% 6(0) *0 0 (code)
<+<<+>>>>>[
% 0 0 (code) M m D d 0 0 *P p (code) 0 c
% where Pp is first op of right code block
%       Dd holds current loop depth (starting at 1)
%       Mm holds the max loop depth yet encountered
%       c = (unbalanced code ? 1 : 0)
<<<[->>+<<]<[->>+<<]<[->>+<<]<[->>+<<]>>>>>>>[-<<<<<<+>>>>>>]<
[->+<<<<<<<+>>>>>>]+>
% 0 0 (code) P p M m D d 1 *P (code) 0 c
-------[-[<->++++++++[-]]
<[-<<
# P is CLOSE; decrease Dd and leave Mm as it was
  { 16b dec >>+<[>-<[->>+<<]]>>[-<<+>>]<<->[-<+<->++++++
            ++[->++++++++<]>[-<++++>]<->]<< }
>>]>]
<[
# P is OPEN; if Mm==Dd then Mm=Dd=inc(Dd) else Dd=inc(Dd)
% (code) P p M m D d *1 0 (code) 0 c  (note: p=0 since P=OPEN)
<<[-<<->>>>>+<<<]<<[[->>+<<]>>>>-<<<<]
% (code) P p *0 m sub(M D) d e D (code) 0 c  (where e=(M==D ? 1 : 0))
>>>[-<<-<+>>>]<<[[->>+<<]>>>[-]<<<]
% (code) P p d *0 sub(M D) sub(m d) e D (code) 0 c  (where e=(Mm==Dd ? 1 : 0))
>>[-<<+>>]<<<[->+>>+<<<]>>[-<<+>>]>>>[-<<<+<<+>>>>>]<[-<<<<<+>>>>>]<<
% (code) P e M m *D d 0 0 (code) 0 c   (where e = (Mm==Dd ? 1 : 0))
  { 16b inc >>>++++++++[-<++++++++>]<[->++++<]<[->+>-<<]
            >+[-<+>]+>-[<->[-]]<[-<[-]<+>>]<< }
<<<[->[-]>[-]>[-<+<+>>]<[->+<]>>[->+<<<+>>]>[-<+>]<<<<<]>>>>>
]
% 0 0 (code P p) M m D d *0 0 (code) 0 c  (where Dd is properly updated)
<< { 16b iszero [[->>+<<]>>>+<<<]>>[-<<+>>]<[[->+<]>>+<<]>[-<+>]+>[<->[-]]<<< }
>>[-<+>>>[>>]>[-]+<<<[<<]]>>
% 0 0 (code P p) M m D d 0 0 *(code) 0 c  (where c is properly updated)
]
% 0 0 (code) M m D d 0 0 *0 c
<<<<
{ 16b dec >>+<[>-<[->>+<<]]>>[-<<+>>]<<->[-<+<->++++++
          ++[->++++++++<]>[-<++++>]<->]<< }
{ 16b isnonzero >[>>+<]>[<]<<[[->>+<<]>>>+<<<]>>[-<<+>>]>[[-]<+>]<<< }
>>[->>>[-]+<<<]<[-]<[-]<[->+<]<[->+<]>>>>>>>[-<<<<+>>>>]<<<<
<<<<<[<<]>+>[>>]>>>
% 0 1 (code) 0 M m *c 0 0 0
# if c==1 output string "Error: unbalanced brackets!\n"
[-<[-]<[-]<<<[<<]>->[>>]
+++++++++++[->++++++>++++++++++>+++<<<]>
% (code) 0 *66 110 33
+++.>++++..---.+++.<-----------.>>-.<+++.-------.
------------.-.+++++++++++.-----------.+++++++++++++.
-----------.++.-.>.<--.++++++++++++++++.-----------------.
++.++++++++.------.+++++++++++++++.-.>+.---[--->+<]>.[-]<<[-]<[-]>>>]
<<<<<[<<]
% T *0 b (code) 0 M m
% where b = (bytecode OK ? 1 : 0) and Mm = maximum loop depth

# This is the Java language backend for awib
# Please refer to the documentation in the full source code distribution
# of awib for additional details
% 23(0) *8 (code) 0 M m
# print Java header
++[-<++++++++<++++++++<++++++++++<++++++++++<+++<++++++++++<++++++++++<+
+++++++++<+++<++++++<++<+++++++++++>>>>>>>>>>>>]<<<+++++.++++.+++.-.+++.
++.<<++.>++++++.<<---.>>>++.<<<.>++++++++++++++.>-.++++++.<.>>>-------.<
<-.++.>-.-.>>+++.<<.--.<<<<+.>.>>---.<<<<<<-.<----------.<-----.++++.+++
.-.+++.++.>>>++.>>+++++.>.>>>++++.<<<.>.<<-.>>>++.<.>>>>----.<<-.-.<+.>+
.-.>>++++.<<.--.<<<<<+.>>.>>---.<<<<<<.<.>>>>.>>>.>--.-.+++.++.<<<<<<.>>
+.>.>>>++.<<<.>.<<-.>>>++.<.>>>.>----.<----.<++.<<<++.++.>>+.++++.<<<.++
++++.-.<<<.<..<----.+++++.>>>>---.>--.---.<+.<.>.>+++.<--.>>>>-..<<<<<.<
+++++++.>>>>+.<<<.>>>>>>+++.<<<<<<<<.>>....>+.>>>>>--.<+.<<-.<<-------.+
+.<.>>+.<<<-------.<.>>....>>----.+++++.>>>.<<<<<.>>++.<<<.<.>>....>>>>>
>>++++.<<<<<--.++.>>>+.-.>>>++++.<<<.--.<<.----.<---.<<.>>----.<<<.<.>>.
...>>>>>>>>----.<<----.-.<--.>+.-.>>++++.<<.--.<<<++++.----.>>---.<<<<<.
>>>>>++.<<<<<<.<..>>....>>>>>+.>+++.<<<+.<+++.---.>+.<<<.<+++++++.>>>---
.>>------.>>>.<<--.++.>.-.>>.<<.--.<<<++.----.>>---.<<<<<.>>+++.>>++++.<
<<<.>>>>>>>>----.<<+++.-.----.+++++.-.>>++++.<<.--.<<<++++.----.>>.<<<<<
.>>>>>++.<---.<<<<.<<<++++++.>.>>........>>++++.<<<-----.>>>+.>++++.>>>+
++++.<<<<<<.>>>---.>>>++.-----.<<<+++.<<--.>>>+++++++.>>++++.<<+.-.+.-..
<<<++.<<--.<.>>........>>++.<<<++.>>>>>+.+.+++++.++++.<<<<<<.>>........>
>++++.>+++.+.<-.>>-------------.<.<<<<.>>>>.<<<<--.<.>>........>>+.>-.+.
<-.>>.>.<<<<<<++.>>>>>>.<<<<<<--.<.>>....<<<++.>..>>....>>---.+++++.<+++
++.>>+++.---.<<+.<.>>+.>>>.<<.<<+.<.>>----.+++.>>>-.<<<<<.++++++++.+.---
------.<<<--.>.>>........>>-.>-.+.<-.>>.<<<-----.>>>++.--------.+.<<<<<.
<.>>....<<<++.>..>>....>>---.+++++.<+++.>>+++.---.<<+.<.>>--.+.<--.>.>.<
<++.<.>>++.>>>+.<<.<<+.<.>>>>>--.<<<<---.>>.>>+.<-.>>>>.<<----.--.<<<.>>
.<<--.<<------.++.<.>++++.>>>>>.<<<.>>>+.<<+.<<<<.<<<--.>.>>........>>>>
>.<<--.<+.<<.<+++++++.>>>>+.>-.>>>>.<<++++++.------.+.<<<-.>>-.<++++++.>
----.+++++.<--.>>>>.<<+++++.------.+.<<<.>>-.<++.>++.>+.-.<<-----.+++++.
>>--.+++.<-.<------.+.<<<<<-------.<.>>....<<<++.>..>>....>>>>>++.++.<<+
+++.<-.<.>--.>----.<<<.>>++.>>>---.------.<<-.<<<.>>----.>>-.+.<<<<.<<<-
-.>.>>........>>++.--.+++++++.<<.<<<.>.>>............>>>>>.<+++++.>>---.
<<<+.<<.>>-.>------.>++++.<++++.>>--.<<.+++++.--------.<<<<<.<.>>.......
.<<<++.>>>.>++.--.>-----.>-.+++++.<<<.>>>>-.>>>.>----.<----.<++++++++.<<
<<<++.++.>----.++++.>+.>>++.-.<<<<<.>.>>>+.<<<<.<<<--.++.>.>>....<<<.>..
>>....>>----.++.>.>>>--.<<<<<----.>++.>----.<<<.>>++.>>>+.------.<<-.<<<
.>>+.>>-.+.<<<<.<<<--.>.>>........>>---.--.>>>>+++.<<<<<<.<<<.>.>>......
......>>---.>>+++++.>>--.-----.<.>++.<<<+.>------.<<--.<------.>+++.<++.
>>>+.<<<<<.<.>>............>>-.>>+++++.<+.<---.>>>>+.--.<-.<------.+.<<<
<<.<.>>........<<<++.>>>.>>>---.--.>>>+.<<<++.>>.<<<<<.>>>>-.>>>++++.>.<
----.<++++.<<<.++.<++++.++++.>>>+.++++++.-.<<<<<.>>>.>+.<<<<.<<<--.++.>.
>>....<<<.>..>>....>>----.++.>++++.>>>--.<<<<<++++.>++.>----.<<<.>>++.>>
>+.------.<<-.<<<.>--.>>>+++++++.--------.+.<<<<.<<<--.>.[<]>[[-]>]
% 23(0) *0 (code) 0 M m
++++++++++++++++[-<++++++++++++++++>]<-[-<<<<<<<<<<<<<<<+<+>>>>>>>>>>>>>>>>]
<<<<<<<<<<<<<<<<<<+<+>>>>>>>>>>>>>>>>>>>>
% 4(0) 1 0 255 255 15(0) *0 (code) 0 M m
>[<+>
% ::: (stack)  0 1:::1 0 c d 15(0) 1 *P i (code) 0 M m
% (where c and d form a two cell counter
%        P(i) is the next op code)
# the stack segment is a sequence of adjacent C and D; these values
# are previous values of the cd counter that have been pushed to stack
# on OPEN; they are in turn popped on CLOSE
-[-[-[-[-[-[-[-[-[-[-[-[[-]
<[
# RMUL2
% ::: (stack) 0 1:::1 0 c d 15(0) *1 0 i (code) 0 M m
+++++[->+++++++++++++++<]>+++.-[--<+>]<---.-[-->+++<]>--.------[-<++>]<-.-
-----------------.+[---->+++++<]>---.+++[-----<++++>]<+.-[-->+<]>----.[-]
<<<+<<+>>>>
% ::: (stack)  0 1:::1 0 c d 11(0) 1 0 1 0 *0 0 i (code) 0 M m
]>]
<[
# RMUL1
% ::: (stack) 0 1:::1 0 c d 15(0) *1 0 i (code) 0 M m
++++++++.---[->++++++++++++++++++<]>+.------------------.+[----<+++++>]<---.
--[----->++<]>-.[-]<<<+>>
% ::: (stack)  0 1:::1 0 c d 11(0) 0 0 1 0 *0 0 i (code) 0 M m
]>]
<[
# LMUL2
% ::: (stack) 0 1:::1 0 c d 15(0) *1 0 i (code) 0 M m
+++++[->+++++++++++++++<]>+++.-[--<+>]<---.-[-->+++<]>--.------[-<++>]<-.-
-----------------.+[---->+++++<]>---.+++[-----<++++>]<+.-[-->+<]>----.[-]
<<<+<<+>>>>
% ::: (stack)  0 1:::1 0 c d 11(0) 1 0 1 0 *0 0 i (code) 0 M m
]>]
<[
# LMUL1
% ::: (stack) 0 1:::1 0 c d 15(0) *1 0 i (code) 0 M m
++++++++.---[->++++++++++++++++++<]>+.------------------.+[----<+++++>]<---.
--[----->++<]>+.[-]<
<<+>>
% ::: (stack)  0 1:::1 0 c d 11(0) 0 0 1 0 *0 0 i (code) 0 M m
]>]
<[
# SET
% ::: (stack) 0 1:::1 0 c d 15(0) *1 0 i (code) 0 M m
++++[->++++++<]>[-<++++<+++<+<++>>>>]<-----------.<+.>+++.<++.
<<+.>++++++++++.>+++++.>+++++++++.-----.<+++.<+.>>[[-]<]+>>+>>
% ::: (stack)  0 1:::1 0 c d 11(0) 1 0 1 0 *0 0 i (code) 0 M m
]>]
<[-
# CLOSE
% ::: (stack)  0 1:::1 0 c d 15(0) *0 0 0 (code) 0 M m
# output: '    }\n\n    private void '
+++++++++++++++++++++++++[-<+<+++++<++++<++<+++>>>>>]<+++++++....<.
>>++++++++++..<....<-------------.++.<+++++.>++++.<--------.>--.<++++
.>>.<++.-------.<++++.-----.>>.>[[-]<]<<<<<<<<<<<<
% ::: (stack)  0 1:::1 *0 c d 15(0) 0 0 0 (code) 0 M m
# fetch xy from top of stack
<[<]<[->>[>]>>>>+<<<<<[<]<]<[->>>[>]>>>>>+<<<<<<[<]<<]>+>+[>]
% ::: (stack)  0 1:::1 *0 c d  0 y x 12(0) 0 0 0 (code) 0 M m
# output: '_x_y'
>>>>>[
>++++++++[->++++++++++++<]>-.[-]
# itoa
++++++++++<<[->>->+<[>-]>[>]<[-<++++++++++<+>>]<<<]++++++++++>>[-<<->>]
>++++++++++<<[->>->+<[>-]>[>]<[-<++++++++++<+>>]<<<]++++++++++>>[-<<->>]
>++++++[-<++++++++>]<<[>[-<+<+>>]<.[-]<.[-]>]
<[>>[-<<+>>]<<.[-]]>>[-]<<++++++[-<++++++++>]<.[-]<
]
% ::: (stack)  0 1:::1 0 c d *0 14(0) 0 0 0 (code) 0 M m
# output: '() {'
+++++++++++++++++++++++++++++++++++++++++[->+++>+>++<<<]
>>-.+.---------.<.<++++++++++.[[-]>]>>>>>>>>>>>
% ::: (stack)  0 1:::1 0 c d 15(0) *0 0 0 (code) 0 M m
]>]
<[-
# OPEN
% ::: (stack)  0 1:::1 0 c d 15(0) *0 0 0 (code) 0 M m
# build ef = dec(cd)
<<<<<<<<<<<<<<<<[[->>+>>>>>>>>+<<<<<<<<<<]<]
>>>>>+<-[>-]>[>]<[+++++++++++++++[-<++++++++++++++++>]<-<->>]<
% ::: (stack)  0 1:::1 0 0 0 e *f 6(0) c d 5(0) *0 0 0 (code) 0 M m
# push a copy of ef to stack
<<<<<[<]>->->[>]>>>
[-<<<<[<]<<+>>>[>]>>>>>>>>>+<<<<<<]>
[-<<<<<[<]<+>>[>]>>>>>>>>>>+<<<<<<]>>>>>>>>
% ::: (stack ef)  0 1:::1 9(0) e f c *d 5(0) 0 0 0 (code) 0 M m
# construct decimal representations of e f c and d
[
% 0 (counters) *n 5(0) 0 0 0
% (where n is the rightmost counter)
# itoa
% (counters) *n 5(0) 0 0 0
>>++++++++++<<[->>->+<[>-]>[>]<[-<++++++++++<+>>]<<<]++++++++++>>[-<<->>]
>++++++++++<<[->>->+<[>-]>[>]<[-<++++++++++<+>>]<<<]++++++++++>>[-<<->>]
>++++++[-<++++++++>]<<[>[-<+<+>>]<:[->>>>+<<<<]<:[->>>>>>+<<<<<<]>]
<[>>[-<<+>>]<<[->>>>>>+<<<<<<]]>>[-]<<++++++[-<++++++++>]<[->>>>>>>>+<<<<<<<<]
% (counters) *0 5(0) n2 n1 n0
% (where n2n1n0 is n in base 10
%        ni is 0 if not significant)
# move down remaining counters to make room for next base 10 rep
<[<]>[[-<<+>>]>]<<<
]
% ::: (stack)  0 1:::1 *0 8(0) e2 e1 e0 f2 f1 f0 c2 c1 c0 *d2 d1 d0 (code) 0 M m
# output: '        while(m{p}!=0){_'
# but with brackets instead of braces
++++++++++++++++++++++++++++++[->++>+>++++>+++<<<<]>>++........>-.
---------------.+.+++.-------.<++++++++.>++++++++.>+.<+++.>++.
<<-------.<+.-------------.-------.>>+++++++++++.>++.>
% 0 41 33 123 95 *0 0 0 0 e2 e1 e0 f2 f1 f0 c2 c1 c0 d2 d1 d0
# output: '_c_d();}'
# replace c and d with the corresponding decimal representation
>>>>>>>>>
>[.[-<<<<<<<<<+>>>>>>>>>]]>[.[-<<<<<<<<<+>>>>>>>>>]]>[.[-<<<<<<<<<+>>>>>>>>>]]
<<<<<<<<<<<<<.>>>>>>>>>>>>>
>[.[-<<<+>>>]]>[.[-<<<+>>>]]>[.[-<<<+>>>]]
<<<<<<<<<<<<<<<<<<<-.+.++++++++++++++++++.------------------>>++.
<<<++++++++++.>->-
% 10 40 *32 125 95 0 c2 c1 c0 e2 e1 e0 f2 f1 f0 d2 d1 d0 0 0 0
# output: '        _e_f();\n    }\n\n    private void _c_d'
# again with e f c and d replaced by their base 10 reps
........>>.>>>>
>[.[->>>>>>>>>+<<<<<<<<<]]
>[.[->>>>>>>>>+<<<<<<<<<]]
>[.[->>>>>>>>>+<<<<<<<<<]]
<<<<<<<.>>>>>>>
>[.[-<<<+>>>]]
>[.[-<<<+>>>]]
>[.[-<<<+>>>]]
% 10 40 32 125 95 0 c2 c1 c0 f2 f1 f0 0 0 *0 d2 d1 d0 e2 e1 e0
<<<<<<<<<
<<<<.+.++++++++++++++++++.<.>>....>.<<<..>>....>-------------.++.---------.
+++++++++++++.>++.<--.>++++.<<.>++.-------.>++++.-----.<<.>>-----.<<<<
% *10 59 32 111 95 0 c2 c1 c0 f2 f1 f0 0 0 0 d2 d1 d0 e2 e1 e0
>>>>>
>[.[-]]>[.[-]]>[.[-]]
<<<<.>>>>>>>>>>
>[.[-]]>[.[-]]>[.[-]]
% 10 59 32 111 95 0 0 0 0 f2 f1 f0 0 0 0 0 0 *0 e2 e1 e0
# restore ef
>[[-<+>]++++++[-<-------->]]
>[[-<+>]++++++[-<-------->]]
>[[-<+>]++++++[-<-------->]]
<<[->++++++++++<]
<[->++++++++++[->++++++++++<]<]
<<<<<
<[[->+<]++++++[->--------<]]
<[[->+<]++++++[->--------<]]
<[[->+<]++++++[->--------<]]
>>[->++++++++++<]<[->++++++++++[->++++++++++<]<]
% 10 59 32 111 95 0 0 0 0 0 *0 0 f 0 0 0 0 0 0 e 0
# output: '() {'
# and move ef into position
<<<<<<<<++++++++.+.---------.>++++++++++++.<<<.
[[-]>]
>>>>>>>[-<<<<<<<<<<+>>>>>>>>>>]
>>>>>>>[-<<<<<<<<<<<<<<<<<<+>>>>>>>>>>>>>>>>>>]
% 0 e f 15(0) 0 *0 0
# leave behind gh = dec(dec(cd)) = dec(ef)
<<<<<<<<<<<<<<<<+<-[>-]>[>]<[+++++++++++++++[-<++++++++++++++++>]<-<->>]
>>>>>>>>>>>>>>>
% ::: (stack) 0 1:::1 0 g h 15(0) *0 0 0 (code) 0 M m
]>]
<[
# RIGHT
% ::: (stack)  0 1:::1 0 c d 15(0) *1 0 i (code) 0 M m
++++++++.---[->+++++++++++++++++++<]>--.--[-----<++>]<-.-[-->+++<]>--.[-]<
<<+<<+>>>>
% ::: (stack) 0 1:::1 0 c d 11(0) 1 0 1 0 *0 0 i (code) 0 M m
]>]
<[
# LEFT
% ::: (stack)  0 1:::1 0 c d 15(0) *1 0 i (code) 0 M m
++++++++.---[->+++++++++++++++++++<]>--.--[-----<++>]<+.[--->++++<]>+.[-]<
<<+<<+>>>>
% ::: (stack) 0 1:::1 0 c d 11(0) 1 0 1 0 *0 0 i (code) 0 M m
]>]
<[
# OUTPUT
% ::: (stack)  0 1:::1 0 c d 15(0) *1 0 i (code) 0 M m
++++++++.---[->++++++++++++++++++++<]>-.+[---<+>]<.+.[-]
<<<<+>>>>
% ::: (stack) 0 1:::1 0 c d 11(0) 1 0 0 0 *0 0 i (code) 0 M m
]>]
<[
# SUB
% ::: (stack)  0 1:::1 0 c d 15(0) *1 0 i (code) 0 M m
++++++++.---[->++++++++++++++++++<]>+.------------------.+[----<+++++>]<---.
+++[----->++++<]>+.-[--<+>]<-.[--->++++<]>+.[-]<
<<+<<+>>>>
% ::: (stack) 0 1:::1 0 c d 11(0) 1 0 1 0 *0 0 i (code) 0 M m
]>]
<[
# INPUT
% ::: (stack)  0 1:::1 0 c d 15(0) *1 0 i (code) 0 M m
++++++++.---[->+++++++++++++++++++<]>.[---<+>]<++.+.[-]
<<<<+>>>>
% ::: (stack) 0 1:::1 0 c d 11(0) 1 0 0 0 *0 0 i (code) 0 M m
]>]
<[
# ADD
% ::: (stack)  0 1:::1 0 c d 15(0) *1 0 i (code) 0 M m
++++++++.---[->++++++++++++++++++<]>+.------------------.+[----<+++++>]<---.
+++[----->++++<]>+.-[--<+>]<---.-[-->+++<]>--.[-]<
<<+<<+>>>>
% ::: (stack) 0 1:::1 0 c d 11(0) 1 0 1 0 *0 0 i (code) 0 M m
]
# optionally append ; and/or itoa(i)
% ::: (stack)  0 1:::1 0 c d 11(0) b 0 a 0 *0 0 i (code) 0 M m
% (where a==1 iff i should be output
%        b==1 iff ';\n' should be output)
<<[->>
% ::: b 0 0 0 *0 0 i (code) 0 M m
# itoa
++++++++++>>[-<<-<+>[<-]<[<]>[->++++++++++>+<<]>>>]++++++++++<<[->>-<<]
<++++++++++>>[-<<-<+>[<-]<[<]>[->++++++++++>+<<]>>>]++++++++++<<[->>-<<]
<++++++[->++++++++<]>>[<[->+>+<<]>.[-]>.[-]<]
>[<<[->>+<<]>>.[-]]<<[-]>>++++++[->++++++++<]>.[-]
<<<<]
<<[+++++[->++++++++++<]>-.[-]++++++++++.[-]<]>>>>>>[-]
% ::: (stack)  0 1:::1 0 c d 15(0) 0 0 *0 (code) 0 M m
# copy up cd; extend the 1 sled; process next operation
<<<<<<<<<<<<<<<<<<[->>+<<]<[->>+<<]+<+>>>>>>>>>>>>>>>>>>>>
>]
% ::: 0 0 0 *0 M m
# footer
>[-]>[-]++++[->++++++++<]>....[->++++<]>---.>++++++++++.<.[-]>.[-]
% ::: 0 0 *0 0 0