> Anyone wants to take up the challenge? What N can be achieved?
Haha, it's Friday afternoon and I decided to take the challenge. I
implemented a very simplistic and stupid translator which is quite small
but just barely manages to pass the test. It does so with 480 bytes
which makes for N = 9 (2^9 = 512).
Here's the script:
#! /usr/bin/perl
while(<STDIN>){
print unless /[:-]/g;
print if s/^(.*):$/* $1/;
print if s/^- (.*)\s+([EMAIL PROTECTED])$/** DONE $1/;
print if s/^- (.*)\s+(@\w+)\s+(@\w+)$/** TODO $1 :$2: :$3:/;
print if s/^- (.*)\s+(@\w+)$/** TODO $1 :$2:/;
print if s/^- (.*)$/** TODO $1/;
print if s/^\s+- (.*)\s+([EMAIL PROTECTED])$/*** DONE $1/;
print if s/^\s+- (.*)\s+(@\w+)\s+(@\w+)$/*** TODO $1 :$2: :$3:/;
print if s/^\s+- (.*)\s+(@\w+)$/*** TODO $1 :$2:/;
print if s/^\s+- (.*)$/*** TODO $1/;
}
Christian
_______________________________________________
Emacs-orgmode mailing list
Remember: use `Reply All' to send replies to the list.
Emacs-orgmode@gnu.org
http://lists.gnu.org/mailman/listinfo/emacs-orgmode
