Skip to search formSkip to main contentSkip to account menu

Deterministic context-free grammar

Known as: Deterministic context free grammar 
In formal grammar theory, the deterministic context-free grammars (DCFGs) are a proper subset of the context-free grammars. They are the subset of… 
Wikipedia (opens in a new tab)

Related topics

Related topics

13 relations
Ambiguous grammarContext-free grammarDeterministic context-free languageDeterministic parsing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A Security Audit of the OpenPGP Format
For over two decades the OpenPGP format has provided the mainstay of email confidentiality and authenticity, and is currently… 
2012
2012
LL conflict resolution using the embedded left LR parser
A method for resolving LL(k) conflicts using small LR(k) parsers (called embedded left LR(k) parsers) is described. An embedded… 
1988
1988
Branch and bound algorithm for phrase level pattern matching by using deterministic context-free grammar
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)