ComPiler200002：Growing a Compiler

合集 - charGoogle(49)

1.{done}GTD170001:【开发】python_wzbackup2017-02-252.GTD180002:【翻译】From the Geometry Junkyard, computational and recreational geometry pointers.2017-03-063.BookMark180002：《Regular Polytopes》2017-05-174.GTD180004:【开发】python_med2017-05-015.BookMark180001：《Logical Foundations of Mathematics and Computational Complexity: A Gentle Introduction》2017-03-136.GTD180003:【开发】python_oeis2017-03-087.AIIE180002：AIIE2015大会主题2017-05-188.AIIE180001：AIIE2016大会主题2017-05-189.BookMark180008：《东方科学文化的复兴》2017-05-1710.BookMark180006：《Proofs Without Words》2017-05-1711.BookMark180007：吴军三部曲2017-05-1712.BookMark180005：coursea--比特币和数字货币技术2017-05-1713.BookMark180004：《Survey of the State of the Art in Human Language Technology》2017-05-1714.BookMark180003：《词义的语言:词义理论的跨学科讨论》2017-05-1715.BookMark180010: 《机械工程控制基础（第六版）》2017-08-2216.GTD180016:【翻译】Software Engineering ≠ Computer Science2017-08-0717.GTD180015:【学习】一文看尽深度学习RNN：为啥就它适合语音识别、NLP与机器翻译？2017-07-3118.GTD180014:【翻译】Combinatory_logic2017-07-2819.GTD180013:【翻译】Improving the Realism of Synthetic Images2017-07-2020.GTD180012:【翻译】Visualizing Algorithms2017-07-2021.GTD180011:【翻译】The future of deep learning2017-07-1922.GitHub180001:【翻译】Using 3D Convolutional Neural Networks for Speaker Verification2017-07-1823.GTD180010：【翻译】Linguistics and Programming Languages2017-07-1824.GTD180009：【翻译】How Google Wants To Rewire The Internet2017-07-1825.GTD180008：【学习】编译原理2017-06-1626.GTD180007：【运维】LINUX学习2017-06-1527.BookMark180009: 《工程控制基础》2017-06-1328.GTD180006：【运维】安装调试GDB2017-06-0629.{done}GTD180005:【翻译】LISP prehistory - Summer 1956 through Summer 1958.2017-05-2330.ComPiler180001：【学习】编译器学习链接2017-05-1831.BookMark250011: 《初等数论及其应用（原书第6版）》2020-10-1732.BookMark210011: 《柏拉图全集》2018-09-2833.ComPiler200004：Library-Oriented Programming2018-06-1134.ComPiler200003：Story-Oriented Programming2018-06-11

35.ComPiler200002：Growing a Compiler2018-05-06

36.GitHub190002:【翻译】Oh shit, git!2017-12-1937.{done}GTD190027:【翻译】The Importance of Excel2017-12-1438.{done}GTD190026:【翻译】The Cell Programming Language2017-11-2939.GTD190025:【翻译】The Lost Art of C Structure Packing2017-11-0540.GTD190024:【翻译】The State of Data Science & Machine Learning2017-10-3141.{done}GTD190023:【翻译】Dynamic Programming: First Principles2017-10-2542.{done}GTD190022: 【翻译】Why we switched from Python to Go2017-10-1843.GTD190021:【翻译】THE NEURAL NET TANK URBAN LEGEND2017-10-1744.{done}GTD190020:【翻译】Functor-Oriented Programming2017-10-1245.ES190001: How To Study Physics2017-09-2946.{done}GTD190019:【翻译】The Coming Software Apocalypse2017-09-2847.GTD190018:【翻译】The Case Against Civilization2017-09-2848.GTD190017:【翻译】Transformer: A Novel Neural Network Architecture for Language Understanding2017-09-0149.CS180001: An Intro to Compilers2017-08-22

收起

http://www.cs.dartmouth.edu/~mckeeman/cs48/mxcom/gem/html/GrowingCompiler.html

 

by Bill McKeeman and Lu He

MathWorks and Dartmouth, May 2009

Contents

• Abstract
• Chapters
• Notes
• References
• Signatures

Abstract

Self-compiling compilers are common. The question is: How far can one go, bootstrapping a (very) small compiler-compiler into more capable compilers?

Context-free grammars are extended to accomodate output. A grammar executing machine (GEM) is introduced which accepts an input text and a grammar, and outputs another text. Both the input text and the output text can also be grammars, permitting the production of ever more powerful grammars. GEM itself can be extended to build-in the capabilities of the previous grammars. The rules of the game require that changing GEM does not add to its original capability -- it merely makes the implementation more robust or faster.

The grammars and the machine have some simple symmetries that lead to actions such as backtracking and decompiling. It is also possible to directly execute bit-strings in the Intel x86 hardware.

Chapters

 

1. Base GEM
   • statement of the problem
   • executable grammars
   • simple examples
2. Robust GEM
   • pre-entered character classes
   • using nowhite, pretty, invert
3. GEM with builtin nowhite and chars
   • using multi-character input and output symbols
   • left-associative arithmetic expressions
   • X86 floating point stack
4. GEM with builtin multichar symbols
   • using Kleene * and ⁺ in executable grammars
5. Running Intel X86 code
   • X86 Assembler
   • calculator
   • atoi
6. Plenty Phrase Names
   • BNF
   • self
   • pretty

 

Notes

The origin of the idea is a undergraduate thesis (UC Santa Cruz, 1978) written by Doug Michels under the supervsion of Bill McKeeman.

The title is inspired by: Guy Steele's 1998 OOPSLA talk Growing a Language.

Thanks to Steve Johnson for critical advice in the preparation of this presentation.

The default font sizes in Firefox are uncomfortably large for this paper. Try [view][edit][zoom][text only][zoom out][zoom out].

References

• Bill McKeeman Compiler and Compiler Course
• Wikipedia Mealy Machine
• Guy Steele Growing a Language.
• Doug Michels A concise extensible metalanguage for translator implementation

Signatures

• Bill McKeeman , MathWorks Fellow
• Lu He, Computer Science Department, Dartmouth

An earlier version was presented to the Computer Science Colloquium, Stanford, March 4, 2009