source: appendixa/bison-desc.xml@ e4ec472

10.0 10.0-rc1 10.1 10.1-rc1 11.0 11.0-rc1 11.0-rc2 11.0-rc3 11.1 11.1-rc1 11.2 11.2-rc1 11.3 11.3-rc1 12.0 12.0-rc1 12.1 12.1-rc1 6.0 6.1 6.1.1 6.3 6.4 6.5 6.6 6.7 6.8 7.0 7.1 7.2 7.3 7.4 7.5 7.5-systemd 7.6 7.6-systemd 7.7 7.7-systemd 7.8 7.8-systemd 7.9 7.9-systemd 8.0 8.1 8.2 8.3 8.4 9.0 9.1 arm bdubbs/gcc13 ml-11.0 multilib renodr/libudev-from-systemd s6-init trunk v4_0 v4_1 v5_0 v5_1 v5_1_1 xry111/arm64 xry111/arm64-12.0 xry111/clfs-ng xry111/lfs-next xry111/loongarch xry111/loongarch-12.0 xry111/loongarch-12.1 xry111/mips64el xry111/pip3 xry111/rust-wip-20221008 xry111/update-glibc
Last change on this file since e4ec472 was cf24ff1, checked in by Gerard Beekmans <gerard@…>, 22 years ago

fixed upper case / lower case mistakes

git-svn-id: http://svn.linuxfromscratch.org/LFS/trunk/BOOK@1891 4aa44e1e-78dd-0310-a6d2-fbcd4c07a689

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