| [e69a59f] | 1 | <sect2><title>Contents of Bison-&bison-contversion;</title>
|
|---|
| [6370fa6] | 2 |
|
|---|
| [bdc08c1] | 3 | <sect3><title>Program Files</title>
|
|---|
| [6370fa6] | 4 |
|
|---|
| [bdc08c1] | 5 | <para>bison and yacc</para></sect3>
|
|---|
| 6 |
|
|---|
| 7 | <sect3><title>Descriptions</title>
|
|---|
| [6370fa6] | 8 |
|
|---|
| [bdc08c1] | 9 | <sect4><title>bison</title>
|
|---|
| [6370fa6] | 10 |
|
|---|
| [b822811] | 11 | <para>Bison is a parser generator, a replacement for YACC. YACC stands for Yet
|
|---|
| [6370fa6] | 12 | Another Compiler Compiler. What is Bison then? It is a program that
|
|---|
| [bdc08c1] | 13 | generates a program that analyzes the structure of a text file. Instead of
|
|---|
| [3cc70a0] | 14 | writing the actual program a user specifies how things should be connected
|
|---|
| [bdc08c1] | 15 | and with those rules a program is constructed that analyzes the
|
|---|
| 16 | text file. There are a lot of examples where structure is needed and
|
|---|
| 17 | one of them is the calculator.</para>
|
|---|
| [6370fa6] | 18 |
|
|---|
| [b822811] | 19 | <para>Given the string :</para>
|
|---|
| [6370fa6] | 20 |
|
|---|
| [b822811] | 21 | <blockquote><literallayout> 1 + 2 * 3</literallayout></blockquote>
|
|---|
| [6370fa6] | 22 |
|
|---|
| [b822811] | 23 | <para>A human can easily come to the result 7. Why? Because of the structure.
|
|---|
| [9aab9f5] | 24 | Our brain knows
|
|---|
| [a9cb6f08] | 25 | how to interpret the string. The computer doesn't know that and Bison
|
|---|
| [6370fa6] | 26 | is a
|
|---|
| 27 | tool to help it understand by presenting the string in the following way
|
|---|
| [b822811] | 28 | to the compiler:</para>
|
|---|
| [6370fa6] | 29 |
|
|---|
| [b822811] | 30 | <blockquote><literallayout> +
|
|---|
| [6370fa6] | 31 | / \
|
|---|
| 32 | * 1
|
|---|
| 33 | / \
|
|---|
| [b822811] | 34 | 2 3</literallayout></blockquote>
|
|---|
| [6370fa6] | 35 |
|
|---|
| [b822811] | 36 | <para>Starting at the bottom of a tree and coming across the numbers 2 and
|
|---|
| [3cc70a0] | 37 | 3 which are joined by the multiplication symbol, the computer
|
|---|
| [6370fa6] | 38 | multiplies 2 and 3. The result of that multiplication is remembered and
|
|---|
| 39 | the next thing that the computer sees is the result of 2*3 and the
|
|---|
| 40 | number 1 which are joined by the add symbol. Adding 1 to the previous
|
|---|
| 41 | result makes 7. In calculating the most complex calculations can be
|
|---|
| 42 | broken down in this tree format and the computer just starts at the
|
|---|
| [51c0c603] | 43 | bottom and works its way up to the top and comes with the correct
|
|---|
| [bdc08c1] | 44 | answer. Of course, Bison isn't only used for calculators
|
|---|
| 45 | alone.</para></sect4>
|
|---|
| 46 |
|
|---|
| 47 | <sect4><title>yacc</title>
|
|---|
| 48 |
|
|---|
| 49 | <para>We create a yacc script which calls bison using the -y option.
|
|---|
| 50 | This is for compatibility purposes for programs which use yacc instead
|
|---|
| 51 | of bison.</para></sect4>
|
|---|
| 52 |
|
|---|
| 53 | </sect3>
|
|---|
| [6370fa6] | 54 |
|
|---|
| 55 | </sect2>
|
|---|
| 56 |
|
|---|
