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