形式语言与自动机
渴望成长的菜鸟
路漫漫其修远兮,吾将上下而求索
展开
-
下推自动机(一)------Pushdown Automata Introduction
Basic Structure of PDAA pushdown automaton is a way to implement a context-free grammar in a similar way we design DFA for a regular grammar. A DFA can remember a finite amount of information, but a P...转载 2018-07-04 19:38:51 · 3255 阅读 · 0 评论 -
下推自动机(二)------Pushdown Automata Acceptance
There are two different ways to define PDA acceptability.Final State AcceptabilityIn final state acceptability, a PDA accepts a string when, after reading the entire string, the PDA is in a final stat...转载 2018-07-04 19:40:27 · 753 阅读 · 0 评论 -
下推自动机(三)------PDA & Context-Free Grammar
If a grammar G is context-free, we can build an equivalent nondeterministic PDA which accepts the language that is produced by the context-free grammar G. A parser can be built for the grammar G.Also,...转载 2018-07-04 19:42:57 · 788 阅读 · 0 评论 -
下推自动机(四)------Pushdown Automata & Parsing
Parsing is used to derive a string using the production rules of a grammar. It is used to check the acceptability of a string. Compiler is used to check whether or not a string is syntactically correc...转载 2018-07-04 19:44:38 · 1204 阅读 · 0 评论