cg #39

/*
 * BrainFlak (https://esolangs.org/wiki/Brain-Flak) interpreter in Rust.
 * Values are signed 64-bit integers or larger.
 * No syntax errors. Any valid opening bracket can be closed with any valid
 * closing bracket, but any combination not specified below causes undefined
 * behavior when evaluated. To improve user experience, this implementation
 * treats those the same way as {]. Any unclosed brackets, along with their
 * contents, or extraneous closing brackets are discarded.
 *
 * Custom operations:
 *
 *    {], {...] - Evaluates to 0. The inner expression, if any, is not
 *    evaluated. Can be used for comments, as long as opening brackets inside
 *    are balanced with an equal amount of closing brackets.
 *
 *    <) - Read a byte from standard input. Evaluates to -1 on EOF, -2 on error,
 *    and a positive integer (the byte) if successful.
 *
 *    <...) - If the inner expression evaluates to a non-negative value,
 *    truncate it to the size of a byte and write it to the standard output.
 *    Negative values cause undefined behavior, except -1 and -2 which close the
 *    standard output and input, respectively (does not actually work properly
 *    in this implementation as Rust doesn't have built-in constructs to do
 *    this). Evaluates to 0 on success, 1 on failure.
 */

/*
 * Copyright (C)2023 Anonymous
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 * THE SOFTWARE.
 */

mod brainflak {
    #[derive(Copy, Clone, PartialEq, Eq)]
    enum BracketType {
        Round,
        Square,
        Curly,
        Angle,
    }
    #[derive(Copy, Clone)]
    enum BracketSide {
        Opening,
        Closing,
    }
    #[derive(Copy, Clone)]
    struct Bracket {
        btype: BracketType,
        side: BracketSide,
    }
    use BracketSide::*;
    use BracketType::*;
    struct Func {
        btype: BracketType,
        monad: bool,
        addr: usize,
    }
    impl TryFrom<u8> for Bracket {
        type Error = ();
        fn try_from(c: u8) -> Result<Self, ()> {
            match c {
                b'(' => Ok(Self {
                    btype: Round,
                    side: Opening,
                }),
                b'[' => Ok(Self {
                    btype: Square,
                    side: Opening,
                }),
                b'{' => Ok(Self {
                    btype: Curly,
                    side: Opening,
                }),
                b'<' => Ok(Self {
                    btype: Angle,
                    side: Opening,
                }),
                b')' => Ok(Self {
                    btype: Round,
                    side: Closing,
                }),
                b']' => Ok(Self {
                    btype: Square,
                    side: Closing,
                }),
                b'}' => Ok(Self {
                    btype: Curly,
                    side: Closing,
                }),
                b'>' => Ok(Self {
                    btype: Angle,
                    side: Closing,
                }),
                _ => Err(()),
            }
        }
    }
    pub struct Program {
        code: Box<[u8]>,
    }
    mod ops {
        pub const NOP: u8 = 0;

        pub const ONE: u8 = 1;
        pub const HEIGHT: u8 = 2;
        pub const POP: u8 = 3;
        pub const SWAP: u8 = 4;

        pub const NEW: u8 = 5;
        pub const PUSH: u8 = 6;
        pub const NEGATE: u8 = 7;
        pub const DROP: u8 = 8;

        pub const SAVE: u8 = 9;
        pub const ZRET: u8 = 10;

        pub const READ: u8 = 11;
        pub const WRITE: u8 = 12;
    }
    use ops::*;
    use std::io;
    use std::io::ErrorKind;
    use std::io::{Read, Write};
    use std::mem;
    impl Program {
        fn backtrack(code: &mut Vec<u8>, f: &Func) {
            code.truncate(f.addr);
        }
        pub fn run(&self, input: Vec<i64>, stdin: impl Read, stdout: impl Write) -> Vec<i64> {
            let mut active = input;
            let mut passive: Vec<i64> = Vec::new();
            let mut data: Vec<i64> = Vec::new();
            let mut rets: Vec<u32> = Vec::new();
            let mut exec: u32 = 0;
            let mut stdin = Some(stdin);
            let mut stdout = Some(stdout);
            let clen = self.code.len() as u32;
            while exec < clen {
                let c = self.code[exec as usize];
                match c {
                    SAVE | ZRET => match c {
                        SAVE => {
                            rets.push(exec + 5);
                            data.push(0);
                            exec = u32::from_le_bytes(
                                self.code[((exec + 1) as usize)..((exec + 5) as usize)]
                                    .try_into()
                                    .unwrap(),
                            );
                        }
                        ZRET => {
                            if active.last().map(|v| *v).unwrap_or(0) != 0 {
                                exec = *rets.last().unwrap();
                            } else {
                                let v = data.pop().unwrap();
                                data.last_mut().map(|pc| *pc += v);
                                rets.pop().unwrap();
                                exec += 1;
                            };
                        }
                        _ => unreachable!(),
                    },
                    NEW => {
                        data.push(0);
                        exec += 1;
                    }
                    NOP | ONE | HEIGHT | POP | SWAP | READ => {
                        let v = match c {
                            NOP => 0,
                            ONE => 1,
                            HEIGHT => active.len() as i64,
                            POP => active.pop().unwrap_or(0),
                            SWAP => {
                                mem::swap(&mut active, &mut passive);
                                0
                            }
                            READ => {
                                let mut buffer = [0; 1];
                                match stdin.as_mut() {
                                    Some(stdin) => match stdin.read_exact(&mut buffer) {
                                        Ok(_) => buffer[0] as i64,
                                        Err(e) => match e.kind() {
                                            ErrorKind::UnexpectedEof => -1,
                                            _ => -2,
                                        },
                                    },
                                    None => -2,
                                }
                            }
                            _ => unreachable!(),
                        };
                        data.last_mut().map(|pc| *pc += v);
                        exec += 1;
                    }
                    PUSH | NEGATE | DROP | WRITE => {
                        let mut v = data.pop().unwrap();
                        match c {
                            PUSH => active.push(v),
                            NEGATE => v = -v,
                            DROP => v = 0,
                            WRITE => {
                                v = match v {
                                    v if v >= 0 => match stdout.as_mut() {
                                        Some(stdout) => match stdout.write_all(&[v as u8]) {
                                            Ok(_) => 0,
                                            Err(_) => 1,
                                        },
                                        None => 1,
                                    },
                                    -1 => stdin.take().map_or(1, |_| 0),
                                    -2 => stdout.take().map_or(1, |_| 0),
                                    _ => 1,
                                }
                            }
                            _ => unreachable!(),
                        }
                        data.last_mut().map(|pv| *pv += v);
                        exec += 1;
                    }
                    _ => panic!(),
                }
            }
            active
        }
        pub fn new(file: impl Read) -> io::Result<Self> {
            let mut funcs: Vec<Func> = Vec::new();
            let mut code: Vec<u8> = Vec::new();
            for b in file.bytes().filter_map(|c| match c {
                Ok(c) => Bracket::try_from(c).ok().map(|c| Ok(c)),
                Err(e) => Some(Err(e)),
            }) {
                let b = b?;
                match b.side {
                    Opening => {
                        funcs.last_mut().map(|f| {
                            if f.monad {
                                return;
                            }
                            f.monad = true;
                            if f.btype == Curly {
                                code.extend([0; 4]);
                            }
                        });
                        funcs.push(Func {
                            btype: b.btype,
                            monad: false,
                            addr: code.len(),
                        });
                        code.push(0);
                    }
                    Closing => 'm: {
                        let f = if let Some(f) = funcs.pop() {
                            f
                        } else {
                            break 'm;
                        };
                        'e: {
                            match f.monad {
                                false => {
                                    code[f.addr] = match (f.btype, b.btype) {
                                        (Round, Round) => ONE,
                                        (Square, Square) => HEIGHT,
                                        (Curly, Curly) => POP,
                                        (Angle, Angle) => SWAP,
                                        (Angle, Round) => READ,
                                        _ => break 'e Err(()),
                                    }
                                }
                                true => {
                                    if let (Curly, Curly) = (f.btype, b.btype) {
                                        code[f.addr] = SAVE;
                                        let addr = &(code.len() as u32).to_le_bytes();
                                        code[(f.addr + 1)..(f.addr + 5)].copy_from_slice(addr);
                                        code.push(ZRET);
                                    } else {
                                        code[f.addr] = NEW;
                                        code.push(match (f.btype, b.btype) {
                                            (Round, Round) => PUSH,
                                            (Square, Square) => NEGATE,
                                            (Angle, Angle) => DROP,
                                            (Angle, Round) => WRITE,
                                            _ => break 'e Err(()),
                                        });
                                    }
                                }
                            }
                            Ok(())
                        }
                        .err()
                        .map(|_| Self::backtrack(&mut code, &f));
                    }
                }
                if code.len() > (u32::MAX as usize) {
                    panic!("Program too large");
                }
            }
            funcs.first().map(|f| Self::backtrack(&mut code, &f));
            code.shrink_to_fit();
            Ok(Self {
                code: code.into_boxed_slice(),
            })
        }
    }
}

pub use brainflak::*;
use std::env;
use std::fs::File;
use std::io;
use std::str::FromStr;

fn main() {
    let mut args = env::args();
    args.next();
    let pfile = File::open(args.next().expect("invalid argument")).expect("failed to open file");
    let mut inputs = Vec::new();
    for p in args {
        inputs.push(i64::from_str(&p).expect("invalid argument"));
    }
    let program = Program::new(pfile).expect("fail");
    for i in program.run(inputs, io::stdin(), io::stdout()) {
        println!("{}", i);
    }
}

dir brain-flak

authors.txt ASCII text

1	// Code by SoundOfSpouting#6980 (UID: 151149148639330304)

brain-flak-docs.factor ASCII text, with very long lines (411)

! // Code by SoundOfSpouting#6980 (UID: 151149148639330304)
! See http://factorcode.org/license.txt for BSD license.
USING: help.markup help.syntax kernel strings urls ;
IN: brain-flak

HELP: unclosed-brain-flak-expression
{ $values
  { "program" object }
}
{ $description "Throws an " { $link unclosed-brain-flak-expression } " error." }
{ $error-description "Thrown during brain-flak compilation if an opened subexpression doesn't have a closing bracket."
} ;

HELP: mismatched-brain-flak-brackets
{ $values
  { "program" object } { "character" object }
}
{ $description "Throws an " { $link mismatched-brain-flak-brackets } " error." }
{ $error-description "Thrown if a bracket is closed with a bracket that doesn't match." } ;

HELP: leftover-program-after-compilation
{ $values
  { "program" object } { "leftover" object }
}
{ $description "Throws an " { $link leftover-program-after-compilation } " error." }
{ $error-description "Thrown if excessive closing brackets are encountered during compilation." } ;


HELP: b-f"
{ $syntax "b-f\"({}[]){<>()}\"" }
{ $description "Syntax for a brain-flak program. It will take a sequence, run the program with the sequence as the initial active stack, and replace the sequence with the final active stack. Syntax and semantics of brain-flak are explained in" { $link "brain-flak" } .
}
{ $errors "Throws an error when the parsed string is not a correct brain-flak program" }
{ $examples
  { $example
    "USING: brain-flak prettyprint ;"
    "{ 2 1 3 7 } b-f\"({{}})\" ."
    "{ 13 }"
  }
  { $example
    "USING: brain-flak prettyprint ;"
    "{ 1 2 } b-f\"(({}({}))[({}[{}])])\" ."
    "{ 2 1 }"
  }
}
{ $see-also compile-brain-flak } ;

HELP: compile-brain-flak
{ $values
  { "string" string }
  { "quote" { $quotation ( seq -- seq ) } }
}
{ $description
  "Compiles a brain-flak program in" { $snippet "string" } "into a quotation that can be run on a sequence of numbers and will return a sequence of numbers. Syntax and semantics of brain-flak are explained in" { $link "brain-flak" } "."
}
{ $errors "Throws an error when the string is not a correct brain-flak program" }
{ $examples
  { $example
    "USING: brain-flak kernel prettyprint ;"
    "\"({{}})\" compile-brain-flak"
    "{ 2 1 3 7 } swap call( seq -- seq ) ."
    "{ 13 }"
  }
  { $example
    "USING: brain-flak kernel prettyprint ;"
    "\"(({}({}))[({}[{}])])\" compile-brain-flak"
    "{ 1 2 } swap call( seq -- seq ) ."
    "{ 2 1 }"
  }
}
{ $see-also \ b-f" } ;

ARTICLE: "brain-flak" "Introduction to brain-flak"
{ { $url URL"https://esolangs.org/wiki/Brain-Flak" "Brain-flak" } " is a stack-based esoteric language designed by Programming Puzzles and Code-Golf user " { $url URL"https://codegolf.stackexchange.com/users/31716/djmcmayhem" "DjMcMayhem" } } . The name is a cross between "\"brainfuck\"" , which was a big inspiration for the language, and "\"flak-overstow\"" , since the language is confusing and stack-based.

{ $heading "Overview" }
Brain-flak is an expression-based language written only using brackets, which must be balanced. Any other character will be ignored. Its only data type is a signed integer, which in this implementation has unbounded size.
{ $nl }
There are two stacks, one of which is considered the { $strong "active" } stack at each point of the execution. Programs start with the active stack initialised with the input data and inactive stack empty, and return the active stack when finished. Popping from an empty stack yields 0.
{ $nl }
Each expression in brain-flak executes some side-effects on the stacks and evaluates to a number. Concatenation of expressions performs their side-effects from left to right and evaluates to a sum of their evaluations.

{ $heading "Functions" }
There are two types of functions in brain-flak: nilads, that are brackets without any contents, and monads, which are non-empty bracketed subexpressions.
{ $nl }
Nilads:
{ $list
  { { $snippet "()" } " evaluates to 1" }
  { { $snippet "[]" } " evaluates to the height of the active stack" }
  { { $snippet "{}" } " pops the active stack and evaluates to the popped value" }
  { { $snippet "<>" } " swaps active and inactive stack and evaluates to 0" }
}
Recall that concatenating expressions sums their values, so { $snippet "()()()" } will evaluate to 3, and { $snippet "{}()" } will pop from the active stack and evaluate to one more than the popped value.
{ $nl }
Monads:
{ $list
  { { $snippet "(X)" } " evaluates " { $snippet "X" } ", pushes the result on the stack and evaluates to the same value" }
  { { $snippet "[X]" } " evaluates " { $snippet "X" } " and evaluates to its negation" }
  { { $snippet "{X}" } " evaluates " { $snippet "X" } " in a loop as long as top of the active stack is not 0 and evaluates to the sum of all results" }
  { { $snippet "<X>" } " evaluates " { $snippet "X" } ", discards the result and evaluates to zero" }
}
For example program { $snippet "([(()()())])" } will push numbers 3 and -3 to the stack, and program { $snippet "({{}})" } will replace values on the stack until a zero with their sum.

{ $examples "Examples of brain-flak programs can be seen on its " { $url URL"https://github.com/DJMcMayhem/Brain-Flak/wiki/Stack-Operations" "github wiki" } "." }

{ $heading "Vocabulary" }
The { $vocab-link "brain-flak" } vocabulary provides a brain-flak to Factor compiler in two words: { $subsections compile-brain-flak POSTPONE: b-f" } These offer a way to compile brain-flak strings into quotations and embed them directly in code. Programs compiled this way will take a sequence for their initial active stack and return a sequence of the same type representing the "final" active stack.
;

ABOUT: "brain-flak"

brain-flak-tests.factor ASCII text

! // Code by SoundOfSpouting#6980 (UID: 151149148639330304)
! See http://factorcode.org/license.txt for BSD license.
USING: accessors brain-flak combinators.short-circuit kernel
    strings tools.test ;
IN: brain-flak.tests

{ { } } [ { } "" compile-brain-flak call ] unit-test

{ { } } [ { } b-f"" ] unit-test

{ { } } [ { } "X" compile-brain-flak call ] unit-test

{ { } } [ { } b-f"X" ] unit-test

{ { } } [ { } "()" compile-brain-flak call ] unit-test

{ { } } [ { } b-f"()" ] unit-test

{ { } } [ { } "[]" compile-brain-flak call ] unit-test

{ { } } [ { } b-f"[]" ] unit-test

{ { } } [ { } "{}" compile-brain-flak call ] unit-test

{ { } } [ { } b-f"{}" ] unit-test

{ { } } [ { } "<>" compile-brain-flak call ] unit-test

{ { } } [ { } b-f"<>" ] unit-test

{ { 1 } } [ { } "(())" compile-brain-flak call ] unit-test

{ { 1 } } [ { } b-f"(())" ] unit-test

{ { 1 } } [ { } "((X))" compile-brain-flak call ] unit-test

{ { 1 } } [ { } b-f"((X))" ] unit-test

{ { 1 } } [ { } "(X()X)" compile-brain-flak call ] unit-test

{ { 1 } } [ { } b-f"(X()X)" ] unit-test

{ { 2 } } [ { } "(()())" compile-brain-flak call ] unit-test

{ { 2 } } [ { } b-f"(()())" ] unit-test

{ { 2 2 } } [ { } "((()()))" compile-brain-flak call ] unit-test

{ { 2 2 } } [ { } b-f"((()()))" ] unit-test

{ { 0 } } [ { } "([])" compile-brain-flak call ] unit-test

{ { 0 } } [ { } b-f"([])" ] unit-test

{ { 1 2 3 3 } } [ { 1 2 3 } "([])" compile-brain-flak call ] unit-test

{ { 1 2 3 3 } } [ { 1 2 3 } b-f"([])" ] unit-test

{ { 1 2 2 3 } } [ { 1 2 } "([])([])" compile-brain-flak call ] unit-test

{ { 1 2 2 3 } } [ { 1 2 } b-f"([])([])" ] unit-test

{ { 0 } } [ { } "({})" compile-brain-flak call ] unit-test

{ { 0 } } [ { } b-f"({})" ] unit-test

{ { 1 2 } } [ { 1 2 } "({})" compile-brain-flak call ] unit-test

{ { 1 2 } } [ { 1 2 } b-f"({})" ] unit-test

{ { 1 } } [ { 1 2 } "{}" compile-brain-flak call ] unit-test

{ { 1 } } [ { 1 2 } b-f"{}" ] unit-test

{ { 0 } } [ { 1 2 } "(<>)" compile-brain-flak call ] unit-test

{ { 0 } } [ { 1 2 } b-f"(<>)" ] unit-test

{ { 1 2 0 } } [ { 1 2 } "(<><>)" compile-brain-flak call ] unit-test

{ { 1 2 0 } } [ { 1 2 } b-f"(<><>)" ] unit-test

{ { 0 } } [ { } "([[]])" compile-brain-flak call ] unit-test

{ { 0 } } [ { } b-f"([[]])" ] unit-test

{ { 1 2 -2 } } [ { 1 2 } "([[]])" compile-brain-flak call ] unit-test

{ { 1 2 -2 } } [ { 1 2 } b-f"([[]])" ] unit-test

{ { 0 } } [ { } "([()]())" compile-brain-flak call ] unit-test

{ { 0 } } [ { } b-f"([()]())" ] unit-test

{ { 0 } } [ { } "({<>})" compile-brain-flak call ] unit-test

{ { 0 } } [ { } b-f"({<>})" ] unit-test

{ { 4 3 2 1 0 6 } } [ { 4 } "({(({})[()])})" compile-brain-flak call ] unit-test

{ { 4 3 2 1 0 6 } } [ { 4 } b-f"({(({})[()])})" ] unit-test

{ { 0 } } [ { } "(<()()()>)" compile-brain-flak call ] unit-test

{ { 0 } } [ { } b-f"(<()()()>)" ] unit-test

{ { 1 0 } } [ { 1 2 } "(<<>({}())>)" compile-brain-flak call ] unit-test

{ { 1 0 } } [ { 1 2 } b-f"(<<>({}())>)" ] unit-test

[ "{" compile-brain-flak call ]
[ { [ unclosed-brain-flak-expression? ]
    [ program>> "{" = ]
  } 1&&
] must-fail-with

[ "{>" compile-brain-flak call ]
[ { [ mismatched-brain-flak-brackets? ]
    [ program>> "{>" = ]
  } 1&&
] must-fail-with

[ "{}>" compile-brain-flak call ]
[ { [ leftover-program-after-compilation? ]
    [ program>> "{}>" = ]
    [ leftover>> >string ">" = ]
  } 1&&
] must-fail-with

brain-flak.factor ASCII text

! // Code by SoundOfSpouting#6980 (UID: 151149148639330304)
! See http://factorcode.org/license.txt for BSD license.
USING: accessors assocs combinators combinators.short-circuit
    kernel math sequences sets splitting strings.parser vectors
;
IN: brain-flak


<< ALIAS: ' CHAR: >>


ERROR: unclosed-brain-flak-expression program ;
ERROR: mismatched-brain-flak-brackets program ;
ERROR: leftover-program-after-compilation program leftover ;


<PRIVATE

: matches ( a b -- ? )
  { { ' ( ' ) }
    { ' [ ' ] }
    { ' { ' } }
    { ' < ' > }
    { ' ) ' ( }
    { ' ] ' [ }
    { ' } ' { }
    { ' > ' < }
  } at =
;

: glue ( a stack2 stack1 b -- a+b stack2 stack1 ) roll + -rot ;

: (()) ( ret stack2 stack1 -- ret stack2 stack1 ) 1 glue ;

: ([]) ( ret stack2 stack1 -- ret stack2 stack1 ) dup length glue ;

: ({}) ( ret stack2 stack1 -- ret stack2 stack1 ) dup [ pop glue ] unless-empty ;

: (<>) ( ret stack2 stack1 -- ret stack2 stack1 ) swap ;

: ()) ( ret stack2 stack1 quot -- ret stack2 stack1 ) 0 -roll call rot [ suffix! ] keep glue ; inline

: (]) ( ret stack2 stack1 quot -- ret stack2 stack1 ) 0 -roll call rot neg glue ; inline

: (}) ( ret stack2 stack1 quot -- ret stack2 stack1 ) 0 -roll [ dup { [ empty? ] [ last 0 = ] } 1|| ] swap until rot glue ; inline

: (>) ( ret stack2 stack1 quot -- ret stack2 stack1 ) 0 -roll call rot drop ; inline

: compile-bf-subexpr ( vec string-like -- vec string-like )
  [ { { [ dup empty? ] [ f ] }
      { [ dup first ")]}>" in? ] [ f ] }
      { [ "()" ?head-slice ] [ [ \ (()) suffix! ] dip t ] }
      { [ "[]" ?head-slice ] [ [ \ ([]) suffix! ] dip t ] }
      { [ "{}" ?head-slice ] [ [ \ ({}) suffix! ] dip t ] }
      { [ "<>" ?head-slice ] [ [ \ (<>) suffix! ] dip t ] }
      [ 0 <vector> swap [ rest-slice ] [ first ] bi
        [ compile-bf-subexpr [ [ ] clone-like suffix! ] dip
          [ dup empty?
            [ dup seq>> unclosed-brain-flak-expression ]
            [ rest-slice ] if ] [ ?first ] bi
        ] dip
        over matches
        [ over seq>> mismatched-brain-flak-brackets ] unless
        { { ' ) [ [ \ ()) suffix! ] dip ] }
          { ' ] [ [ \ (]) suffix! ] dip ] }
          { ' } [ [ \ (}) suffix! ] dip ] }
          { ' > [ [ \ (>) suffix! ] dip ] }
        } case t
      ]
    } cond
  ] loop
;

PRIVATE>


: compile-brain-flak ( string -- quote )
  [ "()[]{}<>" in? ] filter dup
  V{ dup V{ } clone-like 0 0 <vector> rot } clone
  swap compile-bf-subexpr
  [ overd leftover-program-after-compilation ] unless-empty
  { 2nip swap clone-like } append! [ ] clone-like nip
;

SYNTAX: b-f" parse-string compile-brain-flak append! ;

summary.txt ASCII text

1	A Brain-flak to Factor compiler

tags.txt ASCII text

brain-flak
languages
parsing
syntax

jan Wiki ¶

the term "sus" indicating suspicion or uncertainty gained popularity thanks to a certain game even though it was in use prior to the games launch further terminology and internet memes that surged in popularity and were influenced by among us are "sussy" and "sussy baka" terms evolved from "sus" the ironic meme "when the imposter is sus" generally paired with a manipulated image of jerma985 and the humorous intentional misspelling of "among us" as "amogus" are other terms associated with the game moreover the "among us everywhere" meme which involves spotting objects reminiscent of the games crewmate character in unexpected places also gained traction in september 2022 "sus" was included in the merriam-webster dictionary

code guessing, round #39 (completed)

specification

results

entries

entry #1

post a comment

entry #2

post a comment

entry #3

post a comment

entry #4

post a comment

entry #5

post a comment

entry #6

post a comment

entry #7

post a comment

entry #8

post a comment

entry #9

post a comment

entry #10

post a comment

entry #11

post a comment

entry #12

post a comment