1. 15
  1.  

  2. 1

    This is very related to things I need to do over the next couple weeks. Thanks!

    1. 2

      Good to hear! Thank you for reading.

    2. 1

      Summary: If a grammar specifies a language, and a language is defined as a set of words where a word is a sequence of letters in some alphabet, you can take a random element out of this set, to use it to test whether any word in the language is accepted by your code.

      Have you also looked at regular languages, and regular expressions to (completely) describe such languages, and how to generate fuzzers for them? Might be useful to generalize your work, and allow construction of fuzzers given only a regex, e.g: #[a-zA-Z0-9]{3}[a-zA-Z0-9]{3}?