c-sharp 8.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236
  1. * MCS: The Ximian C# compiler
  2. The Mono C# compiler is considered feature C# 1.0 complete at
  3. this point and mature. MCS is able to compile itself and many
  4. more C# programs (there is a test suite included that you can
  5. use). It is routinely used to compile Mono, roughly 1.7
  6. million lines of C# code.
  7. The compiler is also fairly fast. On a IBM ThinkPad t40 it
  8. compiles 18,000 lines of C# code per second.
  9. Work on C# 2.0 has started: some pieces of it are available on
  10. the standard compiler with the -2 switch (iterators, method
  11. conversions) and some others are available on the `gmcs'
  12. branch on CVS (generics)
  13. ** Obtaining MCS
  14. The Mono C# compiler is part of the `mcs' module in the Mono CVS
  15. you can get it from our <a href="anoncvs.html">Anonymous CVS</a> server,
  16. or you can get nightly <a href="download.html">download page</a>.
  17. ** Running MCS
  18. MCS is written in C# and uses heavily the .NET APIs. MCS runs
  19. on Linux with the Mono runtime and on Windows with both the
  20. .NET runtime and the Mono runtime.
  21. ** Reporting Bugs in MCS
  22. When you report a bug, try to provide a small test case that would
  23. show the error so we can include this as part of the Mono C# regression
  24. test suite.
  25. If the bug is an error or a warning that we do not flag, write
  26. a sample program called `csXXXX.cs' where XXXX is the code number
  27. that is used by the Microsoft C# compiler that illustrates the
  28. problem. That way we can also do regression tests on the invalid
  29. input.
  30. ** Phases of the compiler
  31. The compiler has a number of phases:
  32. <ul>
  33. * Lexical analyzer: hand-coded lexical analyzer that
  34. provides tokens to the parser.
  35. * The Parser: the parser is implemented using Jay (A
  36. Berkeley Yacc port to Java, that I ported to C#).
  37. The parser does minimal work and syntax checking,
  38. and only constructs a parsed tree.
  39. Each language element gets its own class. The code
  40. convention is to use an uppercase name for the
  41. language element. So a C# class and its associated
  42. information is kept in a "Class" class, a "struct"
  43. in a "Struct" class and so on. Statements derive
  44. from the "Statement" class, and Expressions from the
  45. Expr class.
  46. * Parent class resolution: before the actual code
  47. generation, we need to resolve the parents and
  48. interfaces for interface, classe and struct
  49. definitions.
  50. * Semantic analysis: since C# can not resolve in a
  51. top-down pass what identifiers actually mean, we
  52. have to postpone this decision until the above steps
  53. are finished.
  54. * Code generation: The code generation is done through
  55. the System.Reflection.Emit API.
  56. </ul>
  57. ** CIL Optimizations.
  58. The compiler performs a number of simple optimizations on its input:
  59. constant folding (this is required by the C# language spec) and
  60. can perform dead code elimination.
  61. Other more interesting optimizations like hoisting are not possible
  62. at this point since the compiler output at this point does not
  63. generate an intermediate representation that is suitable to
  64. perform basic block computation.
  65. Adding an intermediate layer to enable the basic block
  66. computation to the compiler should be a simple task, but we
  67. are considering having a generic CIL optimizer. Since all the
  68. information that is required to perform basic block-based
  69. optimizations is available at the CIL level, we might just skip
  70. this step altogether and have just a generic IL optimizer that
  71. would perform hoisting on arbitrary CIL programs, not only
  72. those produced by MCS.
  73. If this tool is further expanded to perform constant folding
  74. (not needed for our C# compiler, as it is already in there)
  75. and dead code elimination, other compiler authors might be
  76. able to use this generic CIL optimizer in their projects
  77. reducing their time to develop a production compiler.
  78. * Open bugs
  79. See the <a href="bugs.html">bugs page</a> for more information.
  80. A test suite is maintained to track the progress of
  81. the compiler and various programs are routinely compiled and
  82. ran.
  83. * Slides
  84. Slides for the Mono C# Compiler presentation at .NET ONE are
  85. available <a
  86. href="http://primates.ximian.com/~miguel/slides-europe-nov-2002/Mono_C_Sharp_Overview_1007.sxi">here</a>
  87. in StarOffice format.
  88. ** History
  89. MCS was able to parse itself on April 2001, MCS compiled itself
  90. for the first time on December 28 2001. MCS became self hosting
  91. on January 3rd, 2002.
  92. The Mono Runtime and the Mono execution engine were able to make
  93. our compiler self hosting on March 12, 2002.
  94. ** Questions and Answers
  95. Q: Does the Mono C# compiler support C# 2.0?
  96. A: At this point the Mono C# compiler supports some of the features of
  97. C# 2.0, but the support has not been completed. To enable 2.0 features
  98. you must use the -2 flag to the compiler.
  99. Q: What features are available as of Feb 2004?
  100. A: Iterators have been implemented as well as method group implicit
  101. conversion to delegates on the main compiler branch.
  102. We have a branch of the compiler in the module `mcs/gmcs' which is
  103. where we are developing the Generics support for the compiler. Plenty
  104. of tests work (see mcs/tests/gen-*.cs for a list of tests), but work
  105. remains to be done.
  106. Q: Will the C# 2.0 features be part of the Mono 1.0 release?
  107. A: Only a few, the generic compiler will not be part of the 1.0
  108. stable release, but a beta preview will be distributed.
  109. Q: Why not write a C# front-end for GCC?
  110. A: I wanted to learn about C#, and this was an exercise in this
  111. task. The resulting compiler is highly object-oriented, which has
  112. lead to a very nice, easy to follow and simple implementation of
  113. the compiler.
  114. I found that the design of this compiler is very similar to
  115. Guavac's implementation.
  116. Targeting the CIL/MSIL byte codes would require to re-architecting
  117. GCC, as GCC is mostly designed to be used for register machines.
  118. The GCC Java engine that generates Java byte codes cheats: it does
  119. not use the GCC backend; it has a special backend just for Java, so
  120. you can not really generate Java bytecodes from the other languages
  121. supported by GCC.
  122. Q: If your C# compiler is written in C#, how do you plan on getting
  123. this working on a non-Microsoft environment.
  124. We will do this through an implementation of the CLI Virtual
  125. Execution System for Unix (our JIT engine).
  126. Our JIT engine is working for the purposes of using the compiler.
  127. The supporting class libraries are being worked on to fully support
  128. the compiler.
  129. Q: Do you use Bison?
  130. A: No, currently I am using Jay which is a port of Berkeley Yacc to
  131. Java that I later ported to C#. This means that error recovery is
  132. not as nice as I would like to, and for some reason error
  133. productions are not being caught.
  134. In the future I want to port one of the Bison/Java ports to C# for
  135. the parser.
  136. Q: Should someone work on a GCC front-end to C#?
  137. A: I would love if someone does, and we would love to help anyone that
  138. takes on that task, but we do not have the time or expertise to
  139. build a C# compiler with the GCC engine. I find it a lot more fun
  140. personally to work on C# on a C# compiler, which has an intrinsic
  141. beauty.
  142. We can provide help and assistance to anyone who would like to work
  143. on this task.
  144. Q: Should someone make a GCC backend that will generate CIL images?
  145. A: I would love to see a backend to GCC that generates CIL images. It
  146. would provide a ton of free compilers that would generate CIL
  147. code. This is something that people would want to look into
  148. anyways for Windows interoperation in the future.
  149. Again, we would love to provide help and assistance to anyone
  150. interested in working in such a project.
  151. Q: What about making a front-end to GCC that takes CIL images and
  152. generates native code?
  153. A: I would love to see this, specially since GCC supports this same
  154. feature for Java Byte Codes. You could use the metadata library
  155. from Mono to read the byte codes (ie, this would be your
  156. "front-end") and generate the trees that get passed to the
  157. optimizer.
  158. Ideally our implementation of the CLI will be available as a shared
  159. library that could be linked with your application as its runtime
  160. support.
  161. Again, we would love to provide help and assistance to anyone
  162. interested in working in such a project.
  163. Q: But would this work around the GPL in the GCC compiler and allow
  164. people to work on non-free front-ends?
  165. A: People can already do this by targeting the JVM byte codes (there
  166. are about 130 compilers for various languages that target the JVM).
  167. Q: Why are you writing a JIT engine instead of a front-end to GCC?
  168. A: The JIT engine and runtime engine will be able to execute CIL
  169. executables generated on Windows.
  170. You might also want to look at the <a href="faq.html#gcc">GCC</a>
  171. section on the main FAQ