Parse a Formal Grammar
Given a type-2 formal grammar, and a string, parse the string using the formal grammar and output the matches for the non-terminals.
Examples
First line is string, following lines are grammar, last line is output, examples are separated by ---
123
n -> any of
0 1 ...
Well anyway, my point is that I think in the philosophy of SE the q/a's here should not rely on external sources but rather should be fully self cointained.
Random idea: someone I know had a birthday a couple days ago, which led to a bunch of people posting on her Facebook timeline. My theory is that some people post birthday messages more than others, but when they do, they post birthday messages to their closest friends. This can serve as an additional metric for the strength/direction of a friendship.
If people X and Y are facebook friends, and they post the same number of birthday messages over the course of the year, but X posts to Y but Y doesn't post to X, then we know that it's a "more directional" friendship of X to Y.
Some challenges are provided with some kind of framework in which the submissions should be ran in, e.g. king-of-the-hill challenges. I wrote the catch the cat challenge, which needs multiple files for the controller. These are currently stored as a gist.
Recently I wanted to delete my github a...
> There was an error verifying your contact information: The phone number you're trying to verify was recently used to verify a different account. Please try a different number.
"
.d8888b. 888 888
d88P Y88b 888 888
Y88b. 888 888 This is a browser feature intended for
"Y888b. 888888 .d88b. 88888b. 888 developers. If someone told you to copy-paste
"Y88b. 888 d88""88b 888 "88b 888 something here to enable a Facebook feature
"888 888 888 888 888 888 Y8P or "hack" someone's account, it is a
Y88b d88P Y88b. Y88..88P 888 d88P scam and will give them access to your
@Maltysen Actually, your answer doesn't work for `1`. The question specs specifically stated that answers should. You still have my +1, but please fix it. :-)
@DrGreenEggsandHamDJ If you need to change something, you just ping me here and I pull the changes. I'm currently experimenting with sandboxing, so that should be automatic soon.
I'm thinking about eventually putting V up there, but it works differently than a lot of languages do, most notably with having a "Starting buffer", e.g. it takes input via how the original text is laid out.
@Dennis Oh, okay, that would actually work really well. Although, I suppose that means I couldn't make it read a file and STDIN, which I was planning on doing, but haven't gotten around to yet.
I've actually never really used emacs. I tried it once for like 5 minutes, but didn't really grok it. Obviously, I wasn't trying super hard if I gave up after only 5 minutes.
Language idea: A variant of Seriously with a deadly twist: The program is put in “...» and run in Jelly. The result, with a space prepended, is run in Cinnamon Gum, from where the output is finally run in Seriously.
Parse a Formal Grammar
Given a type-2 formal grammar, and a string, parse the string using the formal grammar and output the matches for the non-terminals.
Examples
First line is string, following lines are grammar, last line is output, examples are separated by ---
123
n -> any of
0 1 ...
Some challenges are provided with some kind of framework in which the submissions should be ran in, e.g. king-of-the-hill challenges. I wrote the catch the cat challenge, which needs multiple files for the controller. These are currently stored as a gist.
Recently I wanted to delete my github a...
Julia, 82 70 bytes
x->10.^((t=findin([1:5;76;6:16;72;17;19:25;80]+912,x)-1)÷9)⋅(t%9+1)
Try it online!
