'scopeName': 'source.logicode'
'name': 'Logicode'
'fileTypes': ['lgc']
'patterns': [
  {
    'comment': 'Binary Strings'
    'match': '[01]+'
    'name': 'constant.numeric.logicode'
  }, {
    'comment': 'Declarers'
    'match': '(var|cond|circ|out)'
    'name': 'keyword.control.logicode'
  }, {
    'comment': 'Names'
    'begin': '(var |cond |circ )'
    'end': '(\(|[=]|->)'
    'name': 'entity.name.function.logicode'
  }, {
    'comment': 'Keywords'
    'match': '([+=\[\]\/<>]|->)'
    'name': 'keyword.operator.logicode'

'scopeName': 'source.logicode'
'name': 'Logicode'
'fileTypes': ['lgc']
'patterns': [
  {
    'comment': 'Binary Strings'
    'match': '[01]+'
    'name': 'constant.numeric.logicode'
  }, {
    'comment': 'Declarers'
    'match': '(var|cond|circ|out)'
    'name': 'keyword.control.logicode'
  }, {
    'comment': 'Names'
    'begin': '(var |cond |circ )'
    'end': '\(|=|(->)'
    'name': 'entity.name.function.logicode'
  }, {
    'comment': 'Keywords'
    'match': '[+=\[\]\/<>]|(->)'
    'name': 'keyword.operator.logicode'

;name jumpy
;author Destructible Watermelon
;strategy Move the code back, with the data at the start attacking.
; I'm gonna try and make it have multiple processes at some point, but idk
org start
foo for 20
dat #0
rof
mov -20,-379
nop }-1,>-1
seq -2,5
jmp -3
sub.a #3, -363
sub #3, -364
jmp -365
mov 10,-349
start:mov -1, -900
nop <-1,{-1
seq -2,3
jmp -3
jmp 2
mov -19, -918
sub.ab #19,6
spl @5
sub.ab #881,4
sub.ab #900,-4
mov 2,-10
jmp -11
mov -1, -900

;redcode-94b
;assert 1
;name evil
;kill evil
;author tuxcrafting
;strategy replicator
;date 2016-Sep-08
;version 2

CEND	equ 10

start	mov 0, CEND
	sne.i @start, magic
	jmp end_
	add.a #1, start
	add.ab #1, start
	jmp start
end_	spl CEND-6
	jmp 0
magic	dat #666

;redcode-94b
;assert 1
;name smartbot
;kill smartbot
;author tuxcrafting
;strategy scanner building large decoys backward and forward, and transform in a imp when attacked (most of the time)
;strategy tl;dr this thing is evil and will kill you
;date 2016-Sep-06
;version 1

init	spl decoy
	spl scanner
decoyb	mov 0, {ptr
	jmp decoyb
decoy	mov 0, >ptr
	jmp decoy
scanner	jmn attack, @scanptr
frmatck	add #10, scanptr
	jmp scanner
attack	mov ptr, @scanptr
	jmp frmatck
scanptr	dat #2
ptr	dat #init, #1

;name revimp
;author Destructible Watermelon


mov 13,-15
mov 13,-15
mov 13,-15
mov 13,-15
mov 13,-15
mov 13,-15
mov 13,-15
mov 13,-15
mov 13,-15
mov 13,-15
mov 13,-15
mov 13,-15
mov 13,-15
sne 12, 10
jmp 3
mov 8, >8
jmp -3
mov 5,-2
mov 6,5
mov 2,-5
jmp -7
jmp -42
mov -5, >8
dat #-77
dat #-77
dat #-38

;name badscan
;author Destructible Watermelon
;Strategy try to find somebody, pew pew pew.
;Strategy checks two squares at a time, then bombs them if they are different
org scan
scan:add.f #4,scanptr
seq @scanptr,*scanptr
jmp bombing
jmp scan
scanptr:dat #loopcounts+1,#loopcounts+2
bombing:mov scanptr,@scanptr
add.ab #1,scanptr
djn bombing,loopcounts
add.ab #5,loopcounts
add.a #5,scanptr
jmp scan
loopcounts:dat #5,#5

;name lessbadscan
;author Destructible Watermelon
;Strategy try to find somebody, pew pew pew.
;Strategy checks two squares at a time, then bombs them if they are different.
;Strategy lays seven adjacent bombs, then lays them down in the same place again.
org scan
scan:add.f #4,scanptr
seq @scanptr,*scanptr
jmp startbombing
jmp scan
scanptr:dat #loopcounts+1,#loopcounts+2
bomb:dat #0,#0
startbombing:add #-2,scanptr
bombing:mov bomb,@scanptr
add.ab #1,scanptr
djn bombing,loopcounts
add.ab #7,loopcounts

<~(-:},{+:~-~>
>:&):&

input: Hello
elloH
lloHe
loHel
etc...