query: Recursive in BNF grammar
positive_passages.docid: 16956
positive_passages.text: Is there an alternative for flex/bison that is usable on 8-bit embedded systems?
negative_passages.docid: 131451
negative_passages.text: How to convert BNF to EBNF
negative_passages.docid: 123511
negative_passages.text: Writing a recursive block 'while'
negative_passages.docid: 83664
negative_passages.text: Help solving recursive relations
negative_passages.docid: 133643
negative_passages.text: Is it possible to produce a context free grammar for Tikz path? node?
negative_passages.docid: 3119
negative_passages.text: Distribution of Universal Quantifiers
negative_passages.docid: 25545
negative_passages.text: Plurality of verb depending on plurality of list elements
negative_passages.docid: 107596
negative_passages.text: Rules for repeating "to"
negative_passages.docid: 93544
negative_passages.text: Nested Quantifiers true or false
negative_passages.docid: 88739
negative_passages.text: Changing plurality in parentheses
negative_passages.docid: 65221
negative_passages.text: Recursion in an XML schema?
negative_passages.docid: 54794
negative_passages.text: British Olympiad; Combinatorics Recursion
negative_passages.docid: 38956
negative_passages.text: Finding a rule for palindromes
negative_passages.docid: 45560
negative_passages.text: Can all iterative algorithms be expressed recursively?
negative_passages.docid: 110614
negative_passages.text: Boolean expression (grammar) parser in c++
negative_passages.docid: 31573
negative_passages.text: Advanced rules for shortening relative clauses with a participle?
negative_passages.docid: 92111
negative_passages.text: Infinitive and Gerund Construction