[C] lisp to bbcode [BBCODE] [FAGGOTRY]


#include <stdio.h>
#include <string.h>

#define MAX_NESTING 128
#define MAX_POST_SIZE 4096

typedef struct {

    int id;
    const char * name;

} Tags;

typedef struct {

    int memory[MAX_NESTING];
    int * ptr;
    size_t elements;

} Stack;

void stackinit(Stack *);
int pushid(Stack *, int);
int popid(Stack *);

#define pushid(x,y) ((x)->elements++ == MAX_NESTING ? -1 : (*(x)->ptr++ = y))
#define popid(x) ((x)->elements ? (x)->elements--,*--(x)->ptr : 0)
#define stackinit(x) (void)((x)->elements = 0, (x)->ptr = (x)->memory)

int main(void) {

    char buf[MAX_POST_SIZE] = {0};
    char * p = buf;
    int c;
    size_t n;
    Stack stack;

    Tags tags[] = {
        { 0, ")"},
        { 1, "br"},
        { 2, "b"},
        { 3, "i"},
        { 4, "u"},
        { 5, "o"},
        { 6, "code"},
        { 7, "spoiler"} /*add more tags */
    };

    stackinit(&stack);


    fread(buf, 1, sizeof buf - 1, stdin);
    while(*p != 0) {
        if(*p == '\\' && p[1]) {
            putchar(p[1]);
            p += 2;
            continue;
        } else if(*p == '(') {
            if(p[1] == ' ') {
                p++;
                continue;
            }

            if(strtok(++p, " \n") == NULL) {
                fputs(p, stdout);
                break;
            } else {
                printf("[%s]", p);
               
                for(n = 0; n < sizeof tags / sizeof tags[0]; n++)
                    if(strcmp(p, tags[n].name) == 0)
                        if(pushid(&stack, tags[n].id) == -1) {
                            fprintf(stderr, "max nesting level reached\n");
                            return -1;
                        }
                p += strlen(p);
            }
        }
        else if(*p == ')') {
            c = popid(&stack);
            for(n = 0; n < sizeof tags / sizeof tags[0]; n++)
                if(c == tags[n].id) {
                    c ? printf("[/%s]", tags[n].name) : putchar(*tags[n].name);
                    break;
                }
        }

        else putchar(*p);

        p++;
    }

    putchar('\n');


    return 0;

}

Example:

$ cc foo.c -o a
$ ./a
(i (b this is bold and italic) and this just italic)
^D
[i][b]this is bold and italic[/b] and this just italic[/i]

(i (b (o (u EXPERT PROGRAMMER))))

push? pop?
What happened to the cons and cudders?

Why didn't you write that in lisp?

So let me get this straight, you wrote a C program to convert LISP code into BBCode code. What next, writing a Python interpreter in LISP in C to convert BBCode to Python in Python?

This actually isn't a bad idea

>>1
You're the man.  Not a malloc in sight.  Truly Enlightened C is winrar.

I'd have made Tags an anonymous type, however:

struct { int id; const char * name; } tags[] = {
        { 0, ")"},
        { 1, "br"},
        { 2, "b"},
        { 3, "i"},
        { 4, "u"},
        { 5, "o"},
        { 6, "code"},
        { 7, "spoiler"} /*add more tags */
    };

>>7
There are no mallocs only because he uses arbitrarily-sized buffers to hold the input and tag stack. And he didn't even make MAX_NESTING large enough to handle the total possible number of tags that MAX_POST_SIZE might contain. Not very enlightened.

>>8
It truly is EXPERT QUALITY.

You forgot [s] and [m].

peh, it'd be even faster to do in PERL with a couple regex's.

>>7
Hard-on for purely stack-allocated memory? I hope your fucking overly revered stack fucking overflows when you shit some nice large arrays on it because you were too fucking pussy to dynamically allocate them on the heap.

inb4 C99 variable static array sizes.

You absolute idiot, how dare you release code.

Here it is in lisp,

(defun bbcodeify (sexp) (when (listp sexp) (format t "~a~{~a~^ ~}~a" (car sexp) (cdr sexp) (car sexp)) (mapcar #'bbcodeify (cdr sexp)))

fuck.. excuse me in too stoned
(defun bbcodeify (sexp) (cond ((atom sexp) sexp) ((listp sexp) (format nil "[~a]~{~a~^ ~}[~a]" (car sexp) (mapcar #'bbcodeify (cdr sexp)) (car sexp)))))

* (bbcodeify '(i (b this is bold and italic) and this just italic))

"[I][B]THIS IS BOLD AND ITALIC[B] AND THIS JUST ITALIC[I]"

>>11
DO IT IN PERL WITH A COUPLE OF REGEX THEN YOU ALL-TALK-BUT-CANT-WALK FAGGOT!!!!!

>>11
Hard-on for purely stack-allocated memory? I hope your fucking overly revered stack fucking overflows when you shit some nice large arrays on it because you were too fucking pussy to dynamically allocate them on the heap.

No, I have a hard-on for static arrays.  I don't care much where the data is stored.  I prefer global arrays, though.  There is really little reason to use local variables.  Multithreading, perhaps.

this thread is hilarious

OP here
>>10
Only these two? I forgot more, intentionally.
(eg # or rem or br)
That's why I put that comment there.
Left it as an exercise to the reader :P

>>11
Hard-on for purely stack-allocated memory? I hope your fucking overly revered stack fucking overflows when you shit some nice large arrays on it because you were too fucking pussy to dynamically allocate them on the heap.
Too much of a fucking pussy?
Are you right on your mind you fucking moron?
Not only it would make the size of my code 3x bigger, do you want such snippet to eat 10MB from your memory because the programmer wasn't a pussy?
You're a moron, what I could have done is to read input in chunks, less than what it takes for my static stack to fill, parse, print on stdout and repeat.
No fucking need for (re)allocations.

>>12
Release code?
Do you see a licence there? Or my name? Or some makefile?
(why the fuck would anyone put a licence on that anyway)
What I wanted to do is write something that works in C in < 10 minutes, post it on /prog/ and see what code Anon would post.
(like your lisp snippet)
Your lisp snippet however takes the expression as a list, my snip takes it from stdin, there are advantages to my snip. (not that it would take a lot of code to change yours to do that)

>>15
Actually I see more reasons to use a local object than threads :P

>>7
[b]"Fail"[b]

>>18
This may surprise you, but you've just invented the recursive failing meme

http://upload.wikimedia.org/wikipedia/commons/a/ad/Surprised_Kristen.jpg


C:\>gcc.exe foo.c -o a
foo.c:2:19: stdio.h: No such file or directory
foo.c:3:20: string.h: No such file or directory
foo.c:19: error: parse error before "size_t"
foo.c:19: warning: no semicolon at end of struct or union
foo.c:21: warning: data definition has no type or storage class
foo.c:23: error: parse error before '*' token
foo.c:24: error: parse error before '*' token
foo.c:25: error: parse error before '*' token
foo.c: In function `main':
foo.c:36: error: `size_t' undeclared (first use in this function)
foo.c:36: error: (Each undeclared identifier is reported only once
foo.c:36: error: for each function it appears in.)
foo.c:36: error: parse error before "n"
foo.c:50: error: `stack' undeclared (first use in this function)
foo.c:53: error: `stdin' undeclared (first use in this function)
foo.c:65: error: `NULL' undeclared (first use in this function)
foo.c:66: error: `stdout' undeclared (first use in this function)
foo.c:71: error: `n' undeclared (first use in this function)
foo.c:74: error: `stderr' undeclared (first use in this function)

C:\>

lol

>>21
Since you don't have stdio and string, what do you expect?
I bet you don't have the libc either.

module Language.BBCode.Parser
  (parseBBCode)
  where
import Language.BBCode
import Text.ParserCombinators.Parsec

bbcode = many (bbcodeElement <|> bbcodeText)
bbcodeElement = do element <- try bbcodeOpenElement
                   content <- bbcode
                   bbcodeCloseElement element
                   return (Element element content)
bbcodeOpenElement = do char '['
                       s <- many1 (oneOf "abcdefghijklmnopqrstuvwxyz_#*")
                       char ']'
                       return s
bbcodeCloseElement s = string ("[/" ++ s ++ "]")
bbcodeText = many1 (noneOf "[") >>= return . Text

parseBBCode bb = case parse bbcode "" bb of
                   Left  e  -> error $ show e
                   Right bs -> bs

>>17
use (read) you fucking idiot

(defun bbcodeify (sexp) (cond ((atom sexp) sexp) ((listp sexp) (format nil "[~a]~{~a~^ ~}[~a]" (car sexp) (mapcar #'bbcodeify (cdr sexp)) (car sexp)))))


(defun bbcodeify (sexp) (cond ((atom sexp) sexp) ((listp sexp) (format nil "[~a]~{~a~^ ~}[~a]" (car sexp) (mapcar #'bbcodeify (cdr sexp)) (car sexp)))))


(defun bbcodeify (sexp) (cond ((atom sexp) sexp) ((listp sexp) (format nil "[~a]~{~a~^ ~}[~a]" (car sexp) (mapcar #'bbcodeify (cdr sexp)) (car sexp)))))


(defun bbcodeify (sexp) (cond ((atom sexp) sexp) ((listp sexp) (format nil "[~a]~{~a~^ ~}[~a]" (car sexp) (mapcar #'bbcodeify (cdr sexp)) (car sexp)))))


(defun bbcodeify (sexp) (cond ((atom sexp) sexp) ((listp sexp) (format nil "[~a]~{~a~^ ~}[~a]" (car sexp) (mapcar #'bbcodeify (cdr sexp)) (car sexp)))))


(defun bbcodeify (sexp) (cond ((atom sexp) sexp) ((listp sexp) (format nil "[~a]~{~a~^ ~}[~a]" (car sexp) (mapcar #'bbcodeify (cdr sexp)) (car sexp)))))


(defun bbcodeify (sexp) (cond ((atom sexp) sexp) ((listp sexp) (format nil "[~a]~{~a~^ ~}[~a]" (car sexp) (mapcar #'bbcodeify (cdr sexp)) (car sexp)))))


(defun bbcodeify (sexp) (cond ((atom sexp) sexp) ((listp sexp) (format nil "[~a]~{~a~^ ~}[~a]" (car sexp) (mapcar #'bbcodeify (cdr sexp)) (car sexp)))))


(defun bbcodeify (sexp) (cond ((atom sexp) sexp) ((listp sexp) (format nil "[~a]~{~a~^ ~}[~a]" (car sexp) (mapcar #'bbcodeify (cdr sexp)) (car sexp)))))


(defun bbcodeify (sexp) (cond ((atom sexp) sexp) ((listp sexp) (format nil "[~a]~{~a~^ ~}[~a]" (car sexp) (mapcar #'bbcodeify (cdr sexp)) (car sexp)))))


(defun bbcodeify (sexp) (cond ((atom sexp) sexp) ((listp sexp) (format nil "[~a]~{~a~^ ~}[~a]" (car sexp) (mapcar #'bbcodeify (cdr sexp)) (car sexp)))))


(defun bbcodeify (sexp) (cond ((atom sexp) sexp) ((listp sexp) (format nil "[~a]~{~a~^ ~}[~a]" (car sexp) (mapcar #'bbcodeify (cdr sexp)) (car sexp)))))


(defun bbcodeify (sexp) (cond ((atom sexp) sexp) ((listp sexp) (format nil "[~a]~{~a~^ ~}[~a]" (car sexp) (mapcar #'bbcodeify (cdr sexp)) (car sexp)))))


(defun bbcodeify (sexp) (cond ((atom sexp) sexp) ((listp sexp) (format nil "[~a]~{~a~^ ~}[~a]" (car sexp) (mapcar #'bbcodeify (cdr sexp)) (car sexp)))))

>>25
you forgot close tags have [/x]

* [Ben`] (n=Ben@cpc2-hem12-0-0-cust201.lutn.cable.ntl.com): Ben

>>24
I know, read my post:
Your lisp snippet however takes the expression as a list, my snip takes it from stdin, there are advantages to my snip. (not that it would take a lot of code to change yours to do that)

php -r "while(print(preg_replace('/\((b|i|m|o|s|u|aa|br|sub|sup|code|spoiler) (.*)\)/','[$1]$2[/$1]',fgets(STDIN))));"

Doesn't understand nested sexps, it doesn't exit ever and it uses around 80% CPU.

LOL

/r/ enterprisey scalable Java solution

>>30
in before class LispToBBCodeTranslatorGeneratorFactory...

>>31
Was that supposed to be funny? :|

>>27
What?

>>32
:| awkwaaard

>>34
Was that supposed to be funny? C:\

:ι

:^Λ)

php -r "while(print(preg_replace('/\((b|i|m|o|s|u|aa|br|sub|sup|code|spoiler) (.*)\)/','[$1]$2[/$1]',fgets(STDIN))));"

LOL

⌐_⌐

>>38
(b this should be bolded) this should not (b and this should be bolded too)

This is a problem which can't be evaluated with a regular expression - you need to use a stack-based grammar.