Deterministic context-free language
id:
deterministic-context-free-language-285-18324276
title:
Deterministic context-free language
text:
In formal language theory, deterministic context-free languages (DCFL) are a proper subset of context-free languages. They are the context-free languages that can be accepted by a deterministic pushdown automaton. DCFLs are always unambiguous, meaning that they admit an unambiguous grammar. There are non-deterministic unambiguous CFLs, so DCFLs form a proper subset of unambiguous CFLs. DCFLs are of great practical interest, as they can be parsed in linear time, and various restricted forms of DC
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Deterministic_context-free_language
date created:
date modified:
2022-10-29T11:07:40Z
main entity:
{"identifier":"Q450569","url":"https://www.wikidata.org/entity/Q450569"}
image:
fields total:
13
integrity:
13