aQuaYi / computation Public

Notifications You must be signed in to change notification settings
Fork 0
Star 3

Understanding Computation： From Simple Machines to Impossible Programs by Tom Stuart

3 stars 0 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 46 Commits
big-step		big-step
denotational		denotational
deterministic_Turing_machines		deterministic_Turing_machines
deterministic_finite_automata		deterministic_finite_automata
deterministic_pushdown_automata		deterministic_pushdown_automata
fizzbuzz		fizzbuzz
lambda_calculus		lambda_calculus
nondeterministic_finite_automata		nondeterministic_finite_automata
nondeterministic_pushdown_automata		nondeterministic_pushdown_automata
regular_expressions		regular_expressions
small-step		small-step
treetop		treetop
.gitignore		.gitignore
.rubocop.yml		.rubocop.yml
LICENSE		LICENSE
README.md		README.md
cover.jpg		cover.jpg

Repository files navigation

计算的本质

作者在这里提供了全书的完整代码。这个项目就按照自己的喜好，重新组织代码结构。

目录

小步语义: 把执行程序的复杂过程分成更小的片段
大步语义: 递归地执行复杂的程序
指称语义: 把程序转换成别的语言再执行
Treetop: 利用 Treetop 把文本转换成 AST
确定性有限自动机
不确定性有限自动机
正则表达式
确定性下推自动机
不确定性下推自动机
确定性图灵机
FizzBuzz
lambda 演算

About

Understanding Computation： From Simple Machines to Impossible Programs by Tom Stuart

Report repository

Releases

No releases published

Packages

No packages published

Languages

Ruby 100.0%