dyck

Reminds me of Edward Kmett's talks on monoidal parsing in which he has Dyck languages as an example.

Lisp is called the dyck language or the catalan numbers depending on what kind of mathematician you are talking to.

Parsing the tokenization result of a Dyck language still requires as context-free grammar.

What population are you talking about that a full half of them get sent {deck,dick,dock,duck,dyck} photos?

In case anybody is interested, when we generalize the concept we're talking about Dyck languages.

Just such an outfit appears in a portrait of an anonymous Genoese nobleman by the artist van Dyck which, to modern eyes, looks relatively sober.

> it actually does seem to be 100% For all Dyck grammar sequences, infinitely many of them?

Also, to my knowledge, tree sitter cannot move nodes around (which is also very hard for languages that are not as simple as the Dyck language [1]).

Please don't use regular expressions to parse Dyck languages.

The only thing this paper is missing is a direct, self-contained combinatorial proof of the factorial-ratio formula they gave for the hyper-Catalan numbers - digging though the chain of equivalences proved in the references eventually got too annoying for me and I had to sit down and find a proof myself (there is a simple variation of the usual argument for counting Dyck paths [1] that does the trick).

After I'd been watching an episode of Columbo for about three hours I realised it was actually an episode of Columbo, Diagnosis Murder, and Murder She Wrote (I think) consecutively with a few common bit-part actors and I'd nodded off between them:) Edit: I remember it as being Dick van Dyck in all of them, but it was a long time ago and that seems unlikely!

As to knowing that a^nb^n specifically is context-free, as I suggest in the sibling comment, computer scientists who are also AI specialists would recognise a^nb^n immediately, as they would Dyck languages and Reber grammars, because those are standard tests of learnability used to demonstrate various principles, from the good old days of purely symbolic AI, to the brave new world of modern deep learning.

> Dyck/balanced-brackets grammar Yes, it's not the Dyck grammar but another CFG they created, they call it the "cfg3" family.

Bibtex (or most styles) automatically removes capitalization in titles ("Generalizations of dyck words").

My Droid Maxx "learns" profanity in that it will stop marking it with the red squiggly line, but it still won't correct fyck to fuck even when it will correct dyck to duck.

“Dyck, who is the Canada Research Chair in Molecular Medicine and heads up the Cardiovascular Research Centre, says his team did not observe any detrimental functional effects in hearts of mice with smaller hearts and thus would not expect any overt health effects in humans.” This makes sense.

I understand what a CFG is and why Dyck's language (matching parens) is not a regular language.

Ralph Dyck-inspired, [1] with an 8080A micro, starting with 4K (1100 notes) of expensive RAM (later 16K).

Dyck grammar (balanced brackets) are not an a^nb^n, there are several kinds of brackets.