Recursive descent parsing for grammars with contexts
Recursive descent parsing for grammars with contexts
Recursive descent parsing for grammars with contexts
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Extension of CFGs <strong>with</strong> Boolean operationsConjunctive <strong>grammars</strong> (Okhotin, 2001)A → α 1 & . . . & α k ,α i ∈ (Σ ∪ N) ∗“a string w has property A ⇐⇒ w has all the properties α 1, . . . , α k ”{ a n b n c n | n 0 }S → AB & DCA → aA | ε B → bBc | εC → cC | ε D → aDb | εnon-context-free languages generatedcomplexity of basic <strong>parsing</strong> algorithms preservednontrivial properties of subclassesMikhail Barash<strong>Recursive</strong> <strong>descent</strong> <strong>for</strong> <strong>grammars</strong> <strong>with</strong> <strong>contexts</strong>
Change language