@maradydd I'm defining a mostly ABNF-like grammar for a cryptosystem, with the exception of length-prefixed netstrings. Is this dumb y/n?
@maradydd Maybe? You can think of it like a regular language, but with a self-delimiting string. Does that makes it context-sensitive?
-
-
@bascule ... a packrat parser would be a clean and readable way to write it (though not the fastest thing on four wheels). -
@maradydd these are PEGs, right? Can they comprehend length-prefix encoding? -
@bascule Yup. Hammer has the h_length_value(const HParser* length, const HParser* value) combinator for that. The first arg is the ... -
-
-
-
-
- 4 more replies
New conversation -
-
-
@bascule strictly speaking, any finite language (e.g., one in which expressions have a maximum length) is actually regular, but FSAs are ... -
@maradydd I'm looking for something without a prescribed maximum length. If <netstring> is a@hashbreaker netstring, I want <netstring>*
End of conversation
New conversation -
-
-
@bascule ... yes it's context-sensitive, but even if it's finite, a context-sensitive grammar will be a cleaner way to represent it, and ...Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@bascule ... terribly space-inefficient (and hard to read) for representing length-value encodings. If there's no length limit, then ...Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.