Debian Codegraph @

documentation/demos/manual/mfbuild.yo

raw
1 In order to construct tt(mfcalc), the following steps are suggested:
2 itemization(
3 it() Construct a program tt(mfcalc.cc). Actually, it is already available,
4 since all implementations of tt(main()) used so far are identical to
5 each other.
6 it() Construct the parser in a subdirectory tt(parser):
7 itemization(
8 it() First, construct b()'s input file as indicated above. Name
9 this file tt(grammar);
10 it() Run tt(bisonc++ grammar) to produce the files tt(Parser.h),
11 tt(Parserbase.h), tt(Parser.ih) and tt(parse.cc);
12 it() Modify tt(Parser.h) so as to include tt(FunctionPair,
13 s_functions, s_funTab) and tt(d_symbols);
14 it() Modify tt(Parser.ih) so as to include tt(cmath) and optionally
15 `tt(using namespace std)', which is commented out by default;
16 it() Implement tt(data.cc) and tt(lex.cc) to initialize the static
17 data and to contain the lexical scanner, respectively.
18 )
19 it() Now construct tt(mfcalc) in tt(mfcalc.cc)'s directory using the
20 following command:
21 verb(
22 g++ -o mfcalc *.cc parser/*.cc
23 )
24 )