获得徽章 18
- A function takes an input and produces an output. In every function, the same input always produces the same output.
函数还是为了满足人类对于确定性和稳定性的追求评论点赞 - In fact, EBNF is designed to mirror closely the actual code of a recursive-descent parser, so a grammar should always translated into EBNF if recursive-descent is to be used.赞过
评论1 - Category theory for programmers, chapter 5.5 products & chapter 5.6 coproduct 这两个部分粗略的读了一下，需要回头细读。评论点赞
- Indeed, the unrestricted(or type 0) grammars are equivalent to Turing Machines in the same regular grammars are equivalent to finite automata, and thus represent the most general kind of computation known. Context-free grammars also have a corresponding equivalent machine, called a pushdown automaton...展开评论点赞
- We have been using the term context-free without explaining why such rules a in fact "free of context". The simple reason is that the nonterminals appears by themselves to the left of the arrow in context-free rules. Thus, a rule A -> α says that A may be replaced by α anywhere, regardless of where the A occurs. On the other hand, we could informally define context as a pair of strings(of terminals and nonterminals) β, γ, such that a rule would apply only if β occurs before and γ occurs after the nonterminal. We would write this as βAγ -> βαγ. Such a rule in which α != ε is called a context-sensitive grammar rule. Context sensitive grammar rule are more powerful than context-free grammar rules but are also more difficult to use as the basis for a parser.展开赞过 12
- Compiler construction: principles and practices.
Chapter 3.4.3 The Dangling Else Problem 没有仔细看，粗略的过了一下，有空要回头再看下。赞过 评论1
www.reddit.com