English language | French language | Spanish language | German language | Italian language | Russian language | Greek language | Arabic language | Portuguese language | Chinese language | Swedish language | Japanese language | Turkish language | Tamil language | Dutch language | Persian language | Hebrew language | Hungarian language | Irish language | Bengali language | Polish language | Telugu language | Korean language | Welsh language | Java (programming language) | Czech language | Serbian language | Catalan language | Finnish language | Academy Award for Best Foreign Language Film |
Parser algorithms for context-free languages include the CYK algorithm and the Earley's Algorithm.
•
Efficient polynomial-time algorithms for the membership problem are the CYK algorithm and Earley's Algorithm.
•
A special subclass of context-free languages are the deterministic context-free languages which are defined as the set of languages accepted by a deterministic pushdown automaton and can be parsed by a LR(k) parser.