but if You feel that it is too difficult You might try
PLEASE DO ,1 <- #13
DO ,1 SUB #1 <- #238
DO ,1 SUB #2 <- #112
DO ,1 SUB #3 <- #112
DO ,1 SUB #4 <- #0
DO ,1 SUB #5 <- #64
DO ,1 SUB #6 <- #238
DO ,1 SUB #7 <- #26
DO ,1 SUB #8 <- #248
DO ,1 SUB #9 <- #168
DO ,1 SUB #10 <- #24
DO ,1 SUB #11 <- #16
DO ,1 SUB #12 <- #158
DO ,1 SUB #13 <- #52
PLEASE READ OUT ,1
PLEASE GIVE UP
good shot, Bharath!
( I guess you put first_name last_name in Your id )
ok ok i' ll answer the first one...
it' s the most amusing language I found around !!
none... note... not foul language the name is brainfuck
and is the language that mostly resembles a Turing Machine
no punched tapes around so consider the array elements as punched tape positions
here is the wonderfully simple syntax
> increment the pointer (to point to the next cell to the right).
< decrement the pointer (to point to the next cell to the left).
+ increment (increase by one) the byte at the pointer.
- decrement (decrease by one) the byte at the pointer.
. output the value of the byte at the pointer.
, accept one byte of input, storing its value in the byte at the pointer.
[ jump forward to the command after the corresponding ] if the byte at the pointer is zero.
] jump back to the command after the corresponding [ if the byte at the pointer is nonzero.
searching for brainfuck will yield a few links,
... the explanation on wikipedia is not bad at all
by the way both snippets are the "Hello World!" program