Notice removed Reward existing answer by Wheat Wizard♦

occurred May 10, 2017 at 14:17

Bounty Ended with Laikoni's answer chosen by Wheat Wizard♦

occurred May 10, 2017 at 14:17

Notice added Reward existing answer by Wheat Wizard♦

occurred May 4, 2017 at 5:17

Bounty Started worth 100 reputation by Wheat Wizard♦

occurred May 4, 2017 at 5:17

commas

Source Link

edited May 2, 2017 at 16:54

Wheat Wizard ♦

100k
22
282
661

This question is part of a series Brain-flak Birthday challenges designed to celebrate Brain-Flak's first Birthday. You can find more information about Brain-Flak's Birthday here.

Today is Brain-Flak's first Birthday! So I thought we would throw it a surprise birthday party. So in your favorite language print

Surprise!
Happy Birthday, Brain-Flak!

(Trailing whitespace is permitted)

As always programs should be golfed. However since Brain-Flak programs are made of brackets, it wont count any brackets in your source against you. (The characters ()[]<>{} don't count towards your byte total), but they must be balanced as to not upset Brain-Flak.

Rules

Here is a breakdown of the rules

The brackets in your source must be balanced. That is the parentheses of your program must be spanned by the following grammar:

S -> SS | (S) | [S] | <S> | {S} | E

where E is the empty string.

That is to say that a balanced string is either the concatenation of two balanced strings, braces around a balanced string, or the empty string.
The score of a program is the number of non-bracket bytes.
Your goal should be to minimize your score in whatever language you choose.
Standard rules apply so you may write either a complete program or a function.
in the event of a tie raw byte count acts as a tie breaker

There are certainly going to be zero byte solutions in certain languages (Parenthesis Hell, Parenthetic, Glypho, Lenguage). Try to find ways to golf well in languages where this is not a trivial task.

This question is part of a series Brain-flak Birthday challenges designed to celebrate Brain-Flak's first Birthday. You can find more information about Brain-Flak's Birthday here.

Today is Brain-Flak's first Birthday! So I thought we would throw it a surprise birthday party. So in your favorite language print

Surprise!
Happy Birthday, Brain-Flak!

(Trailing whitespace is permitted)

As always programs should be golfed. However since Brain-Flak programs are made of brackets, it wont count any brackets in your source against you. (The characters ()[]<>{} don't count towards your byte total), but they must be balanced as to not upset Brain-Flak.

Rules

Here is a breakdown of the rules

The brackets in your source must be balanced. That is the parentheses of your program must be spanned by the following grammar:

S -> SS | (S) | [S] | <S> | {S} | E

where E is the empty string.

That is to say that a balanced string is either the concatenation of two balanced strings braces around a balanced string or the empty string.
The score of a program is the number of non-bracket bytes.
Your goal should be to minimize your score in whatever language you choose.
Standard rules apply so you may write either a complete program or a function.
in the event of a tie raw byte count acts as a tie breaker

There are certainly going to be zero byte solutions in certain languages (Parenthesis Hell, Parenthetic, Glypho, Lenguage). Try to find ways to golf well in languages where this is not a trivial task.

This question is part of a series Brain-flak Birthday challenges designed to celebrate Brain-Flak's first Birthday. You can find more information about Brain-Flak's Birthday here.

Today is Brain-Flak's first Birthday! So I thought we would throw it a surprise birthday party. So in your favorite language print

Surprise!
Happy Birthday, Brain-Flak!

(Trailing whitespace is permitted)

As always programs should be golfed. However since Brain-Flak programs are made of brackets, it wont count any brackets in your source against you. (The characters ()[]<>{} don't count towards your byte total), but they must be balanced as to not upset Brain-Flak.

Rules

Here is a breakdown of the rules

The brackets in your source must be balanced. That is the parentheses of your program must be spanned by the following grammar:

S -> SS | (S) | [S] | <S> | {S} | E

where E is the empty string.

That is to say that a balanced string is either the concatenation of two balanced strings, braces around a balanced string, or the empty string.
The score of a program is the number of non-bracket bytes.
Your goal should be to minimize your score in whatever language you choose.
Standard rules apply so you may write either a complete program or a function.
in the event of a tie raw byte count acts as a tie breaker

There are certainly going to be zero byte solutions in certain languages (Parenthesis Hell, Parenthetic, Glypho, Lenguage). Try to find ways to golf well in languages where this is not a trivial task.

deleted 155 characters in body

Source Link

edited Apr 30, 2017 at 19:18

Wheat Wizard ♦

100k
22
282
661

This question is part of a series Brain-flak Birthday challenges designed to celebrate Brain-Flak's first Birthday. You can find more information about Brain-Flak's Birthday here.

Today is Brain-Flak's first Birthday! So I thought we would throw it a surprise birthday party. So in your favorite language print

Surprise!
Happy Birthday, Brain-Flak!

(Trailing whitespace is permitted)

As always programs should be golfed. However since Brain-Flak programs are made of brackets, it wont count any brackets in your source against you. (The characters ()[]<>{} don't count towards your byte total), but they must be balanced as to not upset Brain-Flak.

So we don't ruin the surprise, Brain-Flak and its derivatives are not allowed to compete in this challenge.

Rules

Here is a breakdown of the rules

The brackets in your source must be balanced. That is the parentheses of your program must be spanned by the following grammar:

S -> SS | (S) | [S] | <S> | {S} | E

where E is the empty string.

That is to say that a balanced string is either the concatenation of two balanced strings braces around a balanced string or the empty string.
The score of a program is the number of non-bracket bytes.
Your goal should be to minimize your score in whatever language you choose.
Standard rules apply so you may write either a complete program or a function.

Brain-Flak derivatives cannot compete.
in the event of a tie raw byte count acts as a tie breaker

There are certainly going to be zero byte solutions in certain languages (Parenthesis Hell, Parenthetic, Glypho, Lenguage). Try to find ways to golf well in languages where this is not a trivial task.

This question is part of a series Brain-flak Birthday challenges designed to celebrate Brain-Flak's first Birthday. You can find more information about Brain-Flak's Birthday here.

Today is Brain-Flak's first Birthday! So I thought we would throw it a surprise birthday party. So in your favorite language print

Surprise!
Happy Birthday, Brain-Flak!

(Trailing whitespace is permitted)

As always programs should be golfed. However since Brain-Flak programs are made of brackets, it wont count any brackets in your source against you. (The characters ()[]<>{} don't count towards your byte total), but they must be balanced as to not upset Brain-Flak.

So we don't ruin the surprise, Brain-Flak and its derivatives are not allowed to compete in this challenge.

Rules

Here is a breakdown of the rules

The brackets in your source must be balanced. That is the parentheses of your program must be spanned by the following grammar:

S -> SS | (S) | [S] | <S> | {S} | E

where E is the empty string.

That is to say that a balanced string is either the concatenation of two balanced strings braces around a balanced string or the empty string.
The score of a program is the number of non-bracket bytes.
Your goal should be to minimize your score in whatever language you choose.
Standard rules apply so you may write either a complete program or a function.

Brain-Flak derivatives cannot compete.
in the event of a tie raw byte count acts as a tie breaker

There are certainly going to be zero byte solutions in certain languages (Parenthesis Hell, Parenthetic, Glypho, Lenguage). Try to find ways to golf well in languages where this is not a trivial task.

This question is part of a series Brain-flak Birthday challenges designed to celebrate Brain-Flak's first Birthday. You can find more information about Brain-Flak's Birthday here.

Today is Brain-Flak's first Birthday! So I thought we would throw it a surprise birthday party. So in your favorite language print

Surprise!
Happy Birthday, Brain-Flak!

(Trailing whitespace is permitted)

As always programs should be golfed. However since Brain-Flak programs are made of brackets, it wont count any brackets in your source against you. (The characters ()[]<>{} don't count towards your byte total), but they must be balanced as to not upset Brain-Flak.

Rules

Here is a breakdown of the rules

The brackets in your source must be balanced. That is the parentheses of your program must be spanned by the following grammar:

S -> SS | (S) | [S] | <S> | {S} | E

where E is the empty string.

That is to say that a balanced string is either the concatenation of two balanced strings braces around a balanced string or the empty string.
The score of a program is the number of non-bracket bytes.
Your goal should be to minimize your score in whatever language you choose.
Standard rules apply so you may write either a complete program or a function.
in the event of a tie raw byte count acts as a tie breaker

There are certainly going to be zero byte solutions in certain languages (Parenthesis Hell, Parenthetic, Glypho, Lenguage). Try to find ways to golf well in languages where this is not a trivial task.

better explanation

Source Link

edited Apr 30, 2017 at 18:56

Wheat Wizard ♦

100k
22
282
661

This question is part of a series Brain-flak Birthday challenges designed to celebrate Brain-Flak's first Birthday. You can find more information about Brain-Flak's Birthday here.

Today is Brain-Flak's first Birthday! So I thought we would throw it a surprise birthday party. So in your favorite language print

Surprise!
Happy Birthday, Brain-Flak!

(Trailing whitespace is permitted)

As always programs should be golfed. However since Brain-Flak programs are made of brackets, it wont count any brackets in your source against you. (The characters ()[]<>{} don't count towards your byte total), but they must be balanced as to not upset Brain-Flak.

So we don't ruin the surprise, Brain-Flak and its derivatives are not allowed to compete in this challenge.

Rules

Here is a breakdown of the rules

The brackets in your source must be balanced. That is the parentheses of your program must be spanned by the following grammar:

S -> SS | (S) | [S] | <S> | {S} | E

where E is the empty string.

That is to say that a balanced string is either the concatenation of two balanced strings braces around a balanced string or the empty string.
The score of a program is the number of non-bracket bytes.
Your goal should be to minimize your score in whatever language you choose.
Standard rules apply so you may write either a complete program or a function.
Brain-Flak derivatives cannot compete.
in the event of a tie raw byte count acts as a tie breaker

There are certainly going to be zero byte solutions in certain languages (Parenthesis Hell, Parenthetic, Glypho, Lenguage). Try to find ways to golf well in languages where this is not a trivial task.

This question is part of a series Brain-flak Birthday challenges designed to celebrate Brain-Flak's first Birthday. You can find more information about Brain-Flak's Birthday here.

Today is Brain-Flak's first Birthday! So I thought we would throw it a surprise birthday party. So in your favorite language print

Surprise!
Happy Birthday, Brain-Flak!

(Trailing whitespace is permitted)

As always programs should be golfed. However since Brain-Flak programs are made of brackets, it wont count any brackets in your source against you. (The characters ()[]<>{} don't count towards your byte total), but they must be balanced as to not upset Brain-Flak.

So we don't ruin the surprise, Brain-Flak and its derivatives are not allowed to compete in this challenge.

Rules

Here is a breakdown of the rules

The brackets in your source must be balanced. That is the parentheses of your program must be spanned by the following grammar:

S -> SS | (S) | [S] | <S> | {S} | E

where E is the empty string
The score of a program is the number of non-bracket bytes.
Your goal should be to minimize your score in whatever language you choose.
Standard rules apply so you may write either a complete program or a function.
Brain-Flak derivatives cannot compete.
in the event of a tie raw byte count acts as a tie breaker

There are certainly going to be zero byte solutions in certain languages (Parenthesis Hell, Parenthetic, Glypho, Lenguage). Try to find ways to golf well in languages where this is not a trivial task.

This question is part of a series Brain-flak Birthday challenges designed to celebrate Brain-Flak's first Birthday. You can find more information about Brain-Flak's Birthday here.

Today is Brain-Flak's first Birthday! So I thought we would throw it a surprise birthday party. So in your favorite language print

Surprise!
Happy Birthday, Brain-Flak!

(Trailing whitespace is permitted)

As always programs should be golfed. However since Brain-Flak programs are made of brackets, it wont count any brackets in your source against you. (The characters ()[]<>{} don't count towards your byte total), but they must be balanced as to not upset Brain-Flak.

So we don't ruin the surprise, Brain-Flak and its derivatives are not allowed to compete in this challenge.

Rules

Here is a breakdown of the rules

The brackets in your source must be balanced. That is the parentheses of your program must be spanned by the following grammar:

S -> SS | (S) | [S] | <S> | {S} | E

where E is the empty string.

That is to say that a balanced string is either the concatenation of two balanced strings braces around a balanced string or the empty string.
The score of a program is the number of non-bracket bytes.
Your goal should be to minimize your score in whatever language you choose.
Standard rules apply so you may write either a complete program or a function.
Brain-Flak derivatives cannot compete.
in the event of a tie raw byte count acts as a tie breaker

There are certainly going to be zero byte solutions in certain languages (Parenthesis Hell, Parenthetic, Glypho, Lenguage). Try to find ways to golf well in languages where this is not a trivial task.