configureの作成

cc コンパイラオプション
% cc [<オプション>] <ファイル名> [<ライブラリ>]

srcdir: コンパイルされるソースに対するディレクトリ
.ac: ユーザーのアクセス権限を証明

#!/bin/bash
cat >>Makefile.am <

# ビルドしてインストール
bin_PROGRAMS=test

#コンパイルする際のコンパイルオプション
#../configureなどルートディレクトリ以外で実行した時のインクルードディレクトリ
test_CFLAGS=-g -l @srcdir@/include/

#test_LDADDはライブラリ
test_LDADD= -lm

#ソースコード
test_SOURCES=test.c 

#ライブラリ用設定
include_HEADERS=test.h 
#ライブラリ作成する際のライブラリ名
lib_LIBRARIES=libtest.a 
#libtest.aのソースコード
libtest_a_SOURCES

#ビルドしないがインストールするファイル
#prefixオプションで指定したディレクトリ以下の/share/パッケージ名に配置
pkgdata_DATA=setting
#C言語からdesineとして参照
AM_CFLAGS= -DEVENTTABLE_CSV=""$(pkgdatadir)/setting""

#再帰的にmakeを実行
SUBDIRS= subdir subdir2/subsubdir 
EOF 
vim Makefile.am 
autoscan 
touch NEWS README AUTHORS ChangeLog 
awk '{if(/AC_INIT/){print "AC_INIT(FULL-PACKAGE-NAME, 0.0.1, name@hoge.jp)";print"AM_INIT_AUTOMAKE"}else{print $0}}' configure.scan >
congifure.ac 
vim configure.ac 
aclocal 
autoheader
autoconf
automake -a -c

C programming

Concepts to know
-Structs, arrays, pointers, and reference types
-File I/O
-Use of command line parameters
-Pass-by-reference and pass-by-value
-Dynamic memory allocation using malloc()
-Use of C libraries

Helpful Skills related C
-Debugging programs
-Reading documentation
-Iterative design
-Good coding standards

#include<stdio.h>
#include<stdlib.h>
#include<stdbool.h>

struct test_struct
{
	int val;
	struct test_struct *next;
}

struct test_struct *head = NULL;
struct test_struct *curr = NULL;

struct test_struct* create_list(int val)
{
	printf("\n creating list with headnode as [%d]\n", val);
	struct test_struct *ptr = (struct test_struct*)malloc(sizeof(struct test_struct));
	if(NULL == ptr)
	{
		printf("\n Node creation failed \n");
		return NULL;
	}
	ptr->val = val;
	ptr->next = NULL;

	head = curr = ptr;
	return ptr;
}

struct test_struct* add_to_list(int val, bool add_to_end)
{
	if(NULL == head)
	{
		return (create_list(val));
	}

	if(add_to_end)
		printf("\n Adding node to end of list with value [%d]\n",val);
	else
		printf("\n Adding node to beginning of list with value [%d]\n", val);

	struct test_struct *ptr = (struct test_struct*)malloc(sizeof(struct test_struct));
	if(NULL == ptr)
	{
		printf("\n Node creation failed \n");
		return NULL;
	}
	ptr->val = val;
	ptr->next = NULL;

	if(add_to_end)
	{
		curr->next = ptr;
		curr = ptr;
	}
	else
	{
		ptr->next = head;
		head = ptr;
	}
	return ptr;
}

struct test_struct* search_in_list(int val, struct test_struct **prev)
{
	struct test_struct *ptr = head;
	struct test_struct *tmp = NULL;
	bool found = false;

	printf("\n Searching the list for value [%d] \n", val);

	while(ptr !=NULL)
	{
		if(ptr->val == val)
		{
			found = true;
			break;
		}
		else
		{
			tmp = ptr;
			ptr = ptr->next;
		}	
	}

	if(true == found)
	{
		if(prev)
			*prev = tmp;
		return ptr;
	}
	else
	{
		return NULL;
	}
}

int delete_from_list(int val)
{
	struct test_struct *prev = NULL;
	struct test_struct *del = NULL;

	printf("\n Deleting value [%d] from list\n",val);

	del = search_in_list(val,&prev);
	if(del == NULL)
	{
		return -1;
	}
	else
	{
		if(prev != NULL)
			prev->next = del->next;

		if(del == curr)
		{
			curr = prev;
		}
		else if(del == head)
		{
			head = del->next;
		}
	}
	free(del);
	del = NULL;

	return 0;
}	
void print_list(void)
{
	struct test_struct *ptr = head;

	printf("\n ----Printing list Start---- \n");
	while(ptr != NULL)
	{
		printf("\n [%d] \n",ptr->val);
		ptr = ptr->next;
	}
	printf("\n -------Printing list End ------ \n");
	return;
}

int main(void)
{
	int i = 0, ret = 0;
	struct test_struct *ptr = NULL;

	print_list();

	for(i = 5; i<10; i++)
			add_to_list(i,true);

	print_list();
	for(i =4; i>0; i--)
		add_to_list(i,false);

	print_list();

	for(i = 1; i<10; i += 4)
	{
		ptr = search_in_list(i, NULL);
		if(NULL == ptr)
		{
			printf("\n Search &#91;val = %d&#93; failed, no such element found\n",i);
		}
		else
		{
			printf("\n Search passed &#91;val = %d&#93;\n", ptr->val);
		}

		print_list();
		ret = delete_from_list(i);
		if(ret != 0)
		{
			printf("\n delete [val = %d] failed, no such element found\n",i);
		}
		else
		{
			printf("\n delete [val = %d] passed \n", i);
		}
		print_list();
	}
	return 0;
}

gcc

[vagrant@localhost c]$ gcc -v
Using built-in specs.
Target: x86_64-redhat-linux
コンフィグオプション: ../configure --prefix=/usr --mandir=/usr/share/man --infodir=/usr/share/info --with-bugurl=http://bugzilla.redhat.com/bugzilla --enable-bootstrap --enable-shared --enable-threads=posix --enable-checking=release --with-system-zlib --enable-__cxa_atexit --disable-libunwind-exceptions --enable-gnu-unique-object --enable-languages=c,c++,objc,obj-c++,java,fortran,ada --enable-java-awt=gtk --disable-dssi --with-java-home=/usr/lib/jvm/java-1.5.0-gcj-1.5.0.0/jre --enable-libgcj-multifile --enable-java-maintainer-mode --with-ecj-jar=/usr/share/java/eclipse-ecj.jar --disable-libjava-multilib --with-ppl --with-cloog --with-tune=generic --with-arch_32=i686 --build=x86_64-redhat-linux
スレッドモデル: posix
gcc version 4.4.7 20120313 (Red Hat 4.4.7-17) (GCC)
#include <stdio.h>

int main(void){
  printf("hello world!\n");
  return 0;
}
[vagrant@localhost c]$ gcc -o hello hello.c
[vagrant@localhost c]$ ll
合計 12
-rwxrwxr-x. 1 vagrant vagrant 6425 11月 10 06:31 2016 hello
-rw-rw-r--. 1 vagrant vagrant   84 11月 10 06:30 2016 hello.c
[vagrant@localhost c]$ ./hello
hello world!

なお、Cでつまづきやすいと言われているポインタですが、アドレスの値を定義して(参照渡し)、データ型よりもメモリの消費を節約する仕組みで、より高速なプログラムが書けるようになります。

realloc()関数

割り当て済み猟奇のサイズを変更することができる。

#include 
#include 

#define BUFF_SIZE 256

int main(void)
{
    int i;
    unsigned char *pmem = NULL, *pmemsave = NULL, *pmemnew = NULL;
    
    pmemsave = pmem = (unsigned char *)malloc(BUFF_SIZE);
    if (pmem == NULL){
        fprintf(stderr, "メモリ割り当てに失敗しました。\n");
        exit(EXIT_FAILURE);
    }
    
    for (i = 0; i < BUFF_SIZE; i++)
        *pmem++ = (unsigned char)i;
    
    pmem = pmemsave;
    
    for (i = 0; i < BUFF_SIZE; i++)
        printf("%u ", *pmem++);
    printf("\n");
    
    pmemnew = realloc(pmemsave, BUFF_SIZE * 2);
    if (pmemnew != NULL){
        pmem = pmemnew;
        for (i = 0; i < BUFF_SIZE * 2; i++)
            printf("%u ", *pmem++);
        printf("\n");
        
        free(pmemnew); pmemnew = NULL;
    }
    else {
        free(pmemsave); pmemsave = NULL;
        
        fprintf(stderr, "メモリの再割り当てに失敗しました\n");
        exit(EXIT_FAILURE);
    }
    
    return 0;
}

bbi_misc.cpp

/*****************************/
/*filename:bbi_misc.cpp 雑関数*/
/*****************************/
#include "bbi.h"
#include "bbi_prot.h"

string dbl_to_s(double d)
{
    ostringstream ostr;
    ostr << d;
    return ostr.str();
}

string err_msg(const string& a, const string& b)
{
    if (a == "") return b + "が必要です。"
        if(b == "") return a + "が不正です。";
    return b + "が" + a + "の前に必要です。";
}

void err_exit(Tobj a, Tobj b, Tobj c, Tobj d)
{
    Tobj ob[5];
    ob[1] = a; ob[2] = b; ob[3] = c; ob[4]= d;
    cerr << "line:" << get_lineNo() << "ERROR";
    
    for (int i=1; i<=4 && ob[i].s! = "\1"; i++){
        if (ob[i].type == 'd') cout << ob[i].d;
        if (ob[i].type == 's') cout << ob[i].s;
    }
    cout << endl;
    exit(1);
}

bbi_code.cpp

/**************************************************/
/*filename:bbi_code.cpp メモリ管理と構文チェックと実行*/
/**************************************************/
#include "bbi.h"
#include "bbi_prot.h"

CodeSet code;
int startPc;
int Pc = -1;
int baseReg;
int spReg;
int maxLine;
vector intercode;
char *code_ptr;
double return value;
bool break_Flg, return_Flg, exit_Flg;
Mymemory Dmem;
vector strLITERAL;
vector nbrLITERAL;
bool syntaxChk_mode = false;
extern vector Gtable;

class Mystack {
private:
    stack st;
public:
    void push(double n){ st.push(n); }
    int size() { return (int)st.size(); }
    bool empty() { return st.empty(); }
    double pop(){
        if (st.empty()) err_exit("stack underflow");
        double d = st.top();
        st.pop(); return d;
    }
};

void syntaxChk()
{
    syntaxChk_mode = true;
    for (Pc=1; Pc<(int)intercode.size(); Pc++){
        code = firstCode(Pc);
        switch(code.kind){
            case Func: case Option: case Var:
                break;
            case Else: case End: case Exit:
                code =nextCode(); chk_EofLine();
                break;
            case If: case Elif: case While:
                code = nextCode(); (void)get_expression(0, EofLine);
                break;
            case For:
                code = nextCode();
                (void)get_memAdrs(code);
                (void)get_expression('=', 0);
                (void)get_expression(To, 0);
                if (code.kind == Step) (void)get_expression(Step, 0);
                chk_EofLine();
                break;
            case Fcall:
                fncCall_syntax(code.symNbr);
                chk_EofLine();
                (void)stk.pop();
                break;
            case Print: case Println:
                sysFncExec_syntax(code.kind);
                break;
            case Gvar: case Lvar:
                (void)get_memAdrs(code);
                (void)get_expression('-', EofLine);
                break;
            case Return:
                code = nextCode();
                if (code.kind!='?' && code.kind!=EofLine)(void)get_expression();
                if(code.kind=='?')(void)get_expression('?', 0);
                chk_EofLine();
                break;
            case Break:
                code = nextCode();
                if (code.kind == '?') (void)get_expression('?', 0);
                chk_EofLine();
                break;
            case EofLine:
                break;
            default:
                err_exit("不正な記述です: ", kind_to_s(code.kind));
        }
    }
    syntaxChk_mode = false;
}

void set_startPc(int n)
{
    startPc = n;
}

void execute()
{
    baseReg = 0;
    spReg = Dmem.size();
    Dmem.resize(spReg+1000);
    break_Flg = return_Flg = exit_Flg = false;
    Pc = startPc;
    maxLine = intercode.size() - 1;
    while (Pc<=maxLine && !exit_Flg){
        statement();
    }
    Pc = -1;
}

void statement()
{
    CodeSet save;
    int top_line, end_line, varAdrs;
    double wkVal, endDt, stepDt;
    
    if (Pc>maxLine || exit_Flg) return;
    code = save = firstCode(Pc);
    top_line = Pc; end_line = code.jmpAdrs;
    if (code.kind == If) end_line = endline_of_If(Pc);
    
    switch(code.kind){
        case If:
            if (get_expression(If, 0)){
                ++Pc; block(); Pc = end_line + 1;
                return;
            }
            Pc = save.jmpAdrs;
            while (lookCode(Pc) == Elif){
                save = firstCode(Pc); code = nextCode();
                if (get_expression()){
                    ++Pc; block(); Pc = end_line + 1;
                    return;
                }
                Pc = save.jmpAdrs;
            }
            if (lookCode(Pc) == Else){
                ++Pc; block(); Pc = end_line + 1;
                return;
            }
            ++Pc;
            break;
        case While:
            for(;;){
                if (!get_expression(While, 0)) break;
                ++Pc; block();
                if (break_Flg || return_Flg || exit_Flg){
                    break_Flg = false; break;
                }
                Pc = top_line; code = firstCode(Pc);
            }
            Pc = end_line + 1;
            break;
        case For:
            save = nextCode();
            varAdrs = get_memAdrs(save);
            
            expression('=', 0);
            set_dtTyp(save, DBL_T);
            Dmem.set(varAdrs, stk.pop());
            
            endDt = get_expression(To, 0);
            
            if (code.kind == Step) stepDt = get_expression(Step, 0); else stepDt = 1.0;
            for(;; PC=top_line){
                if (Dmem.get(varAdrs) > endDt) break;
            } else {
                if (Dmem.get(varAdrs) < endDt) break;
            }
            ++Pc; block();
            if (break_Flg || return_Flg || exit_Flg) {
                break_Flg = false; break;
            }
            Dmem.add(varAdrs, stepDt);
            }
    Pc = end_line+1;
    break;
case Fcall:
    fncCall(code.symNbr);
    (void)stk.pop();
    ++Pc;
    break;
case Func:
    Pc = end_line + 1;
    break;
case Print: case Println:
    sysFncExec(code.kind);
    ++Pc;
    break;
case Gvar: case Lvar:
    varAdrs = get_memAdrs(code);
    expression('=', 0);
    set_dtTyp(save, DBL_T);
    Dmem.set(varAdrs, stk.pop());
    ++Pc;
    break;
case Return:
    wkVal = returnValue;
    code = nextCode();
    if (code.kind!='?' && code.kind!=EofLine)
        wkVal = get_expression();
    post_if_set(return_Flg);
    if (return_Flg) returnValue = wkVal;
    if(!return_Flg) ++Pc;
    break;
case Break:
    code = nextCode(); post_if_set(break_Flg);
    if(!break_Flg) ++ Pc;
    break;
case Exit:
    code = nextCode(); exit_Flg = true;
    break;
case Option: case Var: case EofLine:
    ++Pc;
    break;
default:
    err_exit("不正な記述です:", kind_to_s(code.kind));
    }
}

void block()
{
    TknKind k;
    while (!break_Flg && !return_Flg && !exit_Flg){
        k = lookCode(Pc);
        if (k==Elif || k==Else || k==End) break;
        statement();
    }
}

double get_expression(int kind1, int kind2)
{
    expression(kind1, kind2); return stk.pop();
}

void expression(int kind1, int kind2)
{
    if (kind1 != 0) code =chk_nextCode(code, kind1);
    expression();
    if (kind2 != 0) code = chk_nextCode(code, kind2);
}

void expression()
{
    term(1);
}

void term(int n)
{
    TknKind op;
    if (n == 7){ factor(); return; }
    term(n+1);
    while(n == opOrder(code.kind)){
        op = code.kind;
        code = nextCode(); term(n+1);
        if (syntaxChk_mode){ stk.pop(); stk.pop(); stk.push(1.0); }
        else binaryExpr(op);
    }
}

void factor()
{
    TknKind kd = code.kind;
    
    if (syntaxChk_mode){
        switch (kd){
            case Not: case Minus: case Plus:
                code = nextCode(); factor(); stk.pop(); stk.push(1.0);
                break;
            case Lparen:
                expression('(', ')');
                break;
            case IntNum: case DblNum:
                stk.push(1.0); code = nextCode();
                break;
            case Gvar: case Lvar:
                (void)get_memAdrs(code); stk.push(1.0);
                break;
            case Toint: case Input:
                sysFncExec_syntax(kd);
                break;
            case Fcall:
                fncCall_syntax(code.symNbr);
                break;
            case EofLine:
                err_exit("式が不正です。");
            default:
                err_exit("式誤り:", kind_to_s(code));
        }
        return;
    }
    
    switch (kd){
        case Not: case Minus: case Plus:
            code = nextCode(); factor();
            if (kd == Not) stk.push(!stk.pop());
            if (kd == Minus) stk.push(-stk.pop());
            break;
        case Lparen:
            expression('(', ')');
            break;
        case IntNum: case DblNum:
            stk.push(code.dblVal); code = nextCode();
            break;
        case Gvar: case Lvar:
            chk_dtTyp(code);
            stk.push(Dmem.get(get_memAdrs(code)));
            break;
        case Toint: case Input:
            sysFncExec(kd);
            break;
        case Fcall:
            fncCall(code.symNbr);
            break;
    }
}

int opOrder(TknKind kd)
{
    switch(kd){
        case Multi: case Divi: case Mod:
        case IntDivi: return 6;
        case Plus: case Minus: return 5;
        case Less: case LessEq:
        case Great: case GreatEq: return 4;
        case Equal: case NotEq: return 3;
        case And: return 2;
        case Or: return 1;
        default: return 0;
    }
}

void binaryExpr(TknKind op)
{
    double d = 0, d2 = stk.pop(), dl = stk.pop();
    
    if ((op == Divi || op == Mod || op==IntDivi) && d2 == 0)
        err_exit("ゼロ除算です。");
    
    switch(op){
        case Plus: d = d1 + d2; break;
        case Minus: d = d1 - d2; break;
        case Multi: d = d1 * d2; break;
        case Divi: d = d1 / d2; break;
        case Mod: d = (int)d1 % (int)d2; break;
        case IntDivi: d = (int)d1 / (int)d2; break;
        case Less: d = d1 < d2; break;
        case LessEq: d = d1 <= d2; break;
        case Great: d = d1 > d2; break;
        case GreatEq: d = d1 >= d2; break;
        case Equal: d = d1 == d2; break;
        case NotEq: d = d1 != d2; break;
        case And: d = d && d2; break;
        case Or: d = d1 || d2; break;
    }
    stk.push(d);
}

void post_if_set(bool& flg)
{
    if (code.kind == EofLine){flg = true; return; }
    if (get_expression('?', 0)) flg = true;
}

void fncCall_syntax(int fncNbr)
{
    int argCt = 0;
    
    code = nextCode(); code = chk_nextCode(code, '(');
    if (code.kind != ')'){
        for (;; code=nextCode()){
            (void)get_expression(); ++argCt;
            if (code.kind != ',') break;
        }
    }
    code = chk_nextCode(code, ')');
    if (argCt != Gtable[fncNbr].args)
        err_exit(Gtable[fncNbr].name, "関数の引数個数が誤っています。");
    stk.push(1.0);
}

void fncCall(int fncNbr)
{
    int n, argCt = 0;
    vector vc;
    
    nextCode(); code = nextCode();
    if (code.kind != ')'){
        for(;; code=nextCode()){
            expression(); ++argCt;
            if(code.kind != ',') break;
        }
    }
    code = nextCode();
    
    for (n = 0; naryLen;
            code = nextCode();
            if (len == 0) return adr;
            
            d = get_expression('[', ']');
            if ((int)d != d)err_exit("添字は端数のない数字で指定してください。");
            if (syntaxChk_mode) return adr;
            
            index = (int)d;
            line = cd.jmpAdrs;
            cd = firstCode(line);
            if (cd.kind==Elif || cd.kind==Else) continue;
            if(cd.kind == End) break;
            return adr + index;
        }

int get_topAdrs(const CodeSet& cd)
        {
            switch(cd.kind){
                case Gvar: return tableP(cd)->adrs;
                case Lvar: return tableP(cd)->adrs + baseReg;
                default: err_exit("変数名が必要です:", kind_to_s(cd));
            }
            return 0;
        }

int endline_of_If(int line)
        {
            CodeSet cd;
            char *save = code_ptr;
            
            cd = firstCode(line);
            for(;;){
                if(index < 0 || len <= index)
                    err_exit(index, "は添字範囲外です(添字範囲:0-", len-1, ")");
            }
            code_ptr = save;
            return line;
        }

    void chk_EofLine()
        {
            if (code.kind != EofLine) err_exit("不正な記述です:", kind_to_s(code));
        }

    TknKind lookCode(int line)
        {
            return (TknKind)(unsigned char)intercode[line][0];
        }

    CodeSet chk_nextCode(const CodeSet& cd, int kind2)
        {
            if (cd.kind != kind2){
                if (kind2 == EofLine) err_exit("不正な記述です: ", kind_to_s(cd));
                if (cd.kind == EofLine) err_exit(kind_to_s(kind2), "が必要です。");
                err_exit(kind_to_s(kind2)+ "が"+ kind_to_s(cd) + "の前に必要です。");
            }
            return nextCode();
        }

    CodeSet firstCode(int line)
        {
            code_ptr = intercode[line];
            return nextCode();
        }

                     CodeSet nextCode()
                     {
                         TknKind kd;
                         short int jmpAdrs, tblNbr;
                         
                         if (*code_ptr == '\0') return CodeSet(EofLine);
                         kd = (TknKind)*UCHAR_P(code_ptr++);
                         switch Func:
                     case While: case For: case If: case Elif: case Else:
                         jmpAdrs = *SHORT_P(code_ptr); code_ptr += SHORT_SIZ;
                         return CodeSet(kd, -1, jmpAdrs);
                     case String:
                         tblNbr = *SHORT_P(code_ptr); code_ptr += SHORT_SIZ;
                         return CodeSet(kd, strLITERAL[tblNbr].c_str());
                     case IntNum: case DblNum:
                         tblNbr = *SHORT_P(code_ptr); code_ptr += SHORT_SIZ;
                         return CodeSet(kd, nbrLITERAL[tblNbr]);
                     case Fcall: case Gvar: case Lvar:
                         tblNbr = *SHORT_P(code_ptr); code_ptr += SHORT_SIZ;
                         return CodeSet(kd, tblNbr, -1);
                     default:
                         return CodeSet(kd);
                     }
                     }
    void chk_dtTpy(const CodeSet& cd)
        {
            if (tableP(cd)->dtTyp == NON_T)
                err_exit("初期化されていない変数が使用されました:", kind_to_s(cd));
        }

void set_dtTyp(const CodeSet& cd, char typ)
        {
            int memAdrs = get_topAdrs(cd);
            vector::iterator p = tableP(cd);
            
            if (p->dtTyp != NON_T)return:
                p->dtTyp = typ;
            if (p->aryLen != 0){
                for (int n=0; n < p->aryLen; n++){ Dmem.set(memAdrs+n, 0);}
            }
        }

    int set_LITERAL(double d)
        {
            for (int n=0; n<(int)nbrLITERAL.size(); n++){
                if (nbrLITERAL[n] == d) return n;
            }
            nbrLITERAL.push_back(d);
            return nbrLITERAL.size() - 1;
        }

    int set_LITERAL(const string& s)
        {
            for (int n=0; n<(int)strLITERAL.size(); n++){
                if (strLITERAL[n] == s) return n;
            }
            strLITERAL.push_back(s);
            return strLITERAL.size() -1;
        }

bbi_tbl.cpp

/**************************************/
/*  filename:bbi_tbl.cpp 記号表処理   */
/**************************************/
#include "bbi.h"
"include "bbi_prot.h"

vector<SymTbl> Gtable;
vector<SymTbl> Ltable;
int startLtable;

int enter(SymTbl& tb, SymKind kind)
{
    int n, mem_size;
    bool isLocal = is_localName(tb.name, kind);
    extern int localAdrs;
    extern Mymemory Dmem;
    
    mem_size = tb.aryLen;
    if (mem_size == 0) mem_size = 1;
    if (kind!=varId && tb.name[0] == '$')
        err_exit("変数名以外で$を使うことはできません:", tb.name);
    tb.nmKind = kind;
    n = -1;
    if (kind == fncId) n = searchName(tb.name, 'G');
    if (kind == paraId) n = searchName(tb.name, 'L');
    if (n != -1) err_exit("名前が重複しています:", tb.name);
    
    if(kind == fncId) tb.adrs = get_lineNo();
    else {
        if (isLocal){ tb.adrs = localAdrs; localAdrs += mem_size; }
        else {
            tb.adrs = Dmem.size();
            Dmem.resize(Dmem.size() + mem_size);
        }
    }
    if (isLocal){ n = Ltable.size(); Ltable.push_back(tb); }
    else { n= Gtable.size(); Gtable.push_back(tb); }
    return n;
}

void set_startLtable()
{
    startLtable = Ltable.size();
}

bool is_localName(const string& name, SymKind kind)
{
    if (kind == paraId) return true;
    if (kind == varId){
        if (is_localScope() && name[0]!='$') return true; else return false;
    }
    return false;
}

int searchName(const string& s, int mode)
{
    int n;
    switch (mode){
            caes 'G':
            for (n=0; n<(int)Gtable.size(); n++){
                if (Gtable&#91;n&#93;.name == s) return n;
            }
            break;
            case 'L':
            for (n=startLtable; n<(int)Ltable.size(); n++)
            {  if(Ltable&#91;n&#93;.name == s) return n;
            }
            break;
            case 'F':
            n = searchName(s, 'G');
            if(n != -1 && Gtable&#91;n&#93;.nmKind==fncId) return n;
            break;
            case 'V':
            if (searchName(s, 'F') != -1) err_exit("関数名と重複しています: ", s);
            if (s&#91;0&#93; == '$') return searchNAme(s, 'G');
            if (is_localScope()) return searchName(s, 'L');
            else return searchName(s, 'G');
    }
    return -1;
}

vector<SymTbl>::iterator tableP(const CodeSet& cd)
{
    if (cd.kind == Lvar) return Ltable.begin() + cd.symNbr;
    return Gtable.begin() + cd.symNbr;
}

bbi_tkn.cpp

/**************************************/
/*  filename:bbi_tkn.cpp トークン処理   */
/**************************************/
#include "bbi.h"
#include "bbi_prot.h"

struct KeyWord {
    const char *keyName;
    TknKind keyKind;
};

KeyWord KeyWdTbl[] = {
    {"func" , Func}, {"var", Var},
    {"if", If}, {"elif", Elif},
    {"else", Else}, {"for", For},
    {"to", To}, {"step", Step},
    {"while", While}, {"end", End},
    {"break", Break}, {"return", Return},
    {"print", Print}, {"println", Println},
    {"option", Option}, {"input", Input},
    {"toint", Toint}, {"exit", Exit},
    {"(", Lparen}, {")", Rparen},
    {"[", Lbracket}, {"]", Rbracket},
    {"+", Plus}, {"-", Minus},
    {"*", Multi}, {"/", Divi},
    {"==", Equal }, {"!=", NotEq },
    {"<", Less}, {"<=", LessEq},
    {">", Great}, {">=",GreatEq },
    {"&&", And}, {"||", Or},
    {"!", Not}, {"%", Mod},
    {"?", Ifsub }, {"=", Assign },
    {"\\", IntDivi }, {",", Comma},
    {"\"", DblQ },
    {"@dummy", END_KeyList},
};

int srcLineno;
TknKind ctyp[256];
char *token_p;
bool endOfFile_F;
char buf[LIN_SIZ+5];
ifstream fin;
#define MAX_LINE 2000

void initChTyp()
{
    int i;
    for (i =0; i<256; i++){ctyp&#91;i&#93;= Others; }
    for(i='0'; i<='9'; i++){ ctyp&#91;i&#93;= Digit; }
    for(i='A'; i<='Z'; i++){ ctyp&#91;i&#93;= Letter; }
    for (i='a'; i<='z'; i++){ ctyp&#91;i&#93;= Letter; }
    ctyp&#91;'_'&#93;=Letter; ctyp&#91;'$'&#93; = Doll;
    ctyp&#91;'('&#93;= Lparen; ctyp&#91;')'&#93;= Rparen;
    ctyp&#91;'&#91;'&#93;=Lbracket; ctyp&#91;'&#93;'&#93;= Rbracket;
    ctyp&#91;'<'&#93;=Less; ctyp&#91;'>']= Great;
    ctyp['+']= Plus; ctyp['-']=Minus;
    ctyp['*']= Multi; ctyp['/']= Divi;
    ctyp['!']= Not, ctyp['%']=Mod;
    ctyp['?']= Ifsub; ctyp['=']= Assign;
    ctyp['\\']= IntDivi; ctyp[',']= Comma;
    ctyp['\"']= DblQ;
}

void fileOpen(char *fname)
{
    srcLineno = 0;
    endOfFile_F = false;
    fin.open(fname);
    if (!fin) { cout << fname << "をオープンにできません\n"; exit(1);}
}

void nextLine()
{
    string s;
    
    if (endOfFile_F) return;
    fin.getline(buf, LIN_SIZ+5);
    if (fin.eof()){
        fin.clear(); fin.close();
        endOfFile_F = true; return;
    }
    
    if (strlen(buf) > LIN_SIZ)
        err_exit("プログラムは1行", LIN_SIZ, "文字以内で記述してください。");
    if (++srcLineno > MAX_LINE)
        err_exit("プログラムが", MAX_LINE, "を超えました。");
    token_p = buf;
}

Token nextLine_tkn()
{
    nextLine();
    return nextTkn();
}

#define CH (*token_p)
#define C2 (*(token_p+1))

#define NEXT_CH() ++token_p
Token nextTkn()
{
    TknKind kd;
    string txt = "";
    
    if (endOfFile_F) return Token(EofProg);
    while (isspace(CH)) NEXT_CH();
    if (CH == '\0') return Token(EofLine);
    
    switch (ctyp[CH]){
        case Doll: case Letter:
            txt += CH; NEXT_CH();
            while (ctyp[CH]== Letter || ctyp[CH]== Digit){ txt += CH; NEXT_CH(); }
            break;
        case Digit:
            kd = IntNum;
            while(ctyp[CH]==Digit) {txt += Ch; NEXT_CH(); }
            if (CH == '.'){ kd =DblNum; txt += CH; NEXT_CH(); }
            while (ctyp[CH] == Digit) { txt += CH; NEXT_CH(); }
            return Token(kd, txt, atof(txt.c_str()));
        case DblQ:
            NEXT_CH();
            while (CH!='\0' && CH!='"'){ txt += CH; NEXT_CH();}
            if (CH == '"') NEXT_CH(); else err_exit("文字列リテラルが閉じていない");
            return Token(String, txt);
        default:
            if (CH=='/' && C2=='/') return Token(EofLine);
            if (is_ope2(CH, C2)) { txt += CH; txt += C2; NEXT_CH(); NEXT_CH(); }
            else { txt += CH; NEXT_CH();}
    }
    kd = get_kind(txt);
    
    if (kd == Others) err_exit("不正なトークンです: ", txt);
    return Token(kd, txt);
}

bool is_ope2(char c1, char c2)
{
    char s[] = " ";
    if (c1 == '\0' || c2=='\0') return false;
    s[1] = c1; s[2]= c2;
    return strstr(" ++ -- <= >= != && || ", s) != NULL;
}

TknKind get_kind(const string& s)
{
    for (int i=0; KeyWdTbl[i].keyKind != END_KeyList; i++){
        if (s == KeyWdTbl[i].keyName) return KeyWdTbl[i].keyKind;
    }
    if (ctyp[S[0]]==Letter || ctyp[s[0]]==Doll) return Ident;
    if (ctyp[s[0]]== Digit) return DblNum;
    return Others;
}

Token chk_nextTkn(const Token& tk, int kind2)
{
    if (tk.kind != kind2) err_exit(err_msg(tk.text, kind_to_s(kind2)));
    return nextTkn();
}

void set_token_p(char *p)
{
    token_p = p;
}

string kind_to_s(int kd)
{
    for (int i=0; ; i++){
        if(KeyWdTbl[i].keyKind == END_KeyList) break;
        if(KeyWdTbl[i].keyKind == kd) return KeyWdTbl[i].keyName;
    }
    return "";
}

string kind_to_s(const CodeSet& cd)
{
    switch (cd.kind){
        case Lvar: case Gvar: case Fcall: return tableP(cd)->name;
        case IntNum: case DblNum: return dbl_to_s(cd.dblVal);
        case String : return string("\"") + cd.text + "\"";
        case EofLine: return "";
    }
    return kind_to_s(cd.kind);
}

int get_lineNo()
{
    extern int Pc;
    return (Pc == -1) ? srcLineno : Pc;
}

bbi_pars.cpp

/**************************************/
/*  filename:bbi.cpp 構文解析         */
/**************************************/
#include "bbi.h"
#include "bbi_prot.h"

#define NO_FIX_ADRS 0
Token token;
SymTbl tmpTb;
int blkNest;
int localAdrs;
int mainTblNbr;
int loopNest;
bool fncDecl_F;
bool explicit_F;
char codebuf[LIN_SIZ+1], *codebuf_p;
extern vector<char*> intercode;

void init()
{
    initChTyp();
    mainTblNbr = -1;
    blkNest = loopNest = 0;
    fncDecl_F = explicit_f = false;
    codebuf_p = codebuf;
}

void convert_to_internalCode(char *fname)
{
    init();
    
    fileOpen(fname);
    while (token=nextLine_tkn(), token.kind != EofProg){
        if (token.kind == Func){
            token = nextTkn(); set_name(); enter(tmpTb, fncId);
        }
    }
    push_intercode();
    fileOpen(fname);
    token = nextLine_tkn();
    while(token.kind != EofProg){
        convert();
    }
    
    set_startPc(1);
    if (mainTblNbr != -1){
        set_startPc(intercode.size());
        setCode(Fcall, mainTblNbr); setCode('('); setCode(')');
        push_intercode();
    }
}

void convert()
{
    switch (token.kind){
        case Option: optionSet(); break;
        case Var: varDec1(); break;
        case Func: fncDec1(); break;
        case While: case For:
            ++loopNest;
            convert_block_set(); setCode_end();
            --loopNest;
            break;
        case If:
            convert_block_set();
            while(token.kind==Elif){ convert_block_set(); }
            if (token.kind == Else) { convert_block_set(); }
            setCode_End();
            break;
        case Break:
            if (loopNest <= 0) err_exit("不正なbreakです。");
            setCode(token.kind); token= nextTkn(); convert_rest();
            break;
        case Return:
            if (!fncDecl_F) err_exit("不正なreturnです。");
            setCode(token.kind); token=nextTkn(); convert_rest();
            break;
        case Exit:
            setCode(token.kind); token = nextTkn(); convert_rest();
            break;
        case Print: case Println:
            setCode(token.kind); token = nextTkn(); convert_rest();
            break;
        case End:
            err_exit("不正なendです。");
            break;
        default: convert_rest(); break;
    }
}

void convert_block_set()
int patch_line;
patch_line = setCode(token.kind, NO_FIX_ADRS); token = nextTkn();
convert_rest();
convert_block();
backPatch(patch_line, get_lineNo());
}

void convert_block()
{
    TknKind k;
    ++blkNest;
    while(k=token.kind, k!=Elif && k!=Else && k!=End && k!=EofProg){
        convert();
    }
    --blkNest;
}

void convert_rest()
{
    int tblNbr;
    
    for(;;){
        if(token.kind == EofLine) break;
        switch (token.kind){
            case If: case Elif:case Eles: case For: case While: case Break:
            case Func: case Return: case Exit: case Print: case Println:
            case Option: case Var: case End:
                err_exit("不正な記述です: ", token.text);
                break;
            case Ident:
                set_name();
                if((tblNbr=searchName(tmpTb.name, 'F')) != -1){
                    if (tmpTb.name== "main") err_exit("main関数の呼び出しはできません。");
                    setCode(Fcall, tblNbr); continue;
                }
                if ((tblNbr=searchName(tmpTb.name, 'V')) == -1){
                    if (explicit_F) err_exit("変数宣言が必要です:", tmpTb.name);
                    tblNbr = enter(tmpTb, varId);
                }
                if (is_localName(tmpTb.name, varId) setCode(Lvar, tblNbr);
                    else setCode(Gvar, tblNbr);
                    continue;
                    case IntNum: case DblNum:
                    setCode(token.kind, set_LITERAL(token.dblVal));
                    break;
                    case String:
                    setCode(token.kind, set_LITERAL(token.text));
                    break;
                    default:
                    setCode(token.kind);
                    break;
        }
                    token = nextTkn();
    }
                    push_intercode();
                    token = nextLine_tkn();
}

void optionSet()
                {
                    setCode(Option);
                    setCode_rest();
                    token = nextTkn();
                    if (token.kind == String && token.text == "var") explicit__F = true;
                    else err_exit("option指定が不正です。");
                    token = nextTkn();
                    setCode_EofLine();
                }

void varDec1()
                {
                    setCode(Var);
                    setCode_rest();
                    for(;;){
                        token = nextTkn();
                        var_namechk(token);
                        set_name(); set_aryLen();
                        enter(tmpTb, varId);
                        if(token.kind != ',')break;
                    }
                    setCode_EofLine();
                }

void var_namechk(const Token& tk)
                {
                    if (tk.kind != Ident) err_exit(err_msg)
                        if (is_localScope() && tk.text&#91;0&#93; == '$')
                            err_exit("関数内のvar宣言では$付き名前を指定できません:", tk.text);
                    if (searchName(tk.text, 'V') != -1)
                        err_exit("識別子が重複しています:", tk.text);
                }

void set_name()
                {
                    if (token.kind != Ident) err_exit("識別子が必要です。:", token.text);
                    tmpTb.clear(); tmpTb.name = token.text;
                    token = nextTkn();
                }
void set_aryLen()
                {
                    tmpTb.aryLen = 0;
                    if (token.kind != '&#91;') return;
                    
                    token = nextTkn();
                    if (token.kind != IntNum)
                        err_exit("配列長は正の整数定数で指定してください。", token.text);
                    tmpTb.aryLen = (int)token.dblVal + 1;
                    token = chk_nextTkn(nextTkn(), '&#93;');
                    if (token.kind == '&#91;') err_exit("多次元配列は宣言できません。");
                }

void fncDecl()
                {
                    extern vector<SymTbl> Gtable;
                    int tblNbr, patch_line, fncTblNbr;
                    
                    if(blkNest > 0) err_exit("関数定義の位置が不正です。");
                    fncDecl_F = true;
                    localAdrs = 0;
                    set_startLtable();
                    patch_line = setCode(Func, NO_FIX_ADRS);
                    token = nextTkn();
                    
                    fncTblNbr = searchName(token.text, 'F');
                    Gtable[fncTblNbr].dtTyp = DBL_T;
                    token = nextTkn();
                    token = chk_nextTkn(token, '(');
                    setCode('(');
                    if (token.kind != ')'){
                        for (;; token=nextTkn()){
                            set_name();
                            tblNbr = enter(tmpTb, paraId);
                            setCode(Lvar, tblNbr);
                            ++Gtable[fncTblNbr].args;
                            if(token.kind != ',')break;
                            setCode(',');
                        }
                    }
                    token = chk_nextTkn(token, ')');
                    setCode(')'); setCode_EofLine();
                    convert_block();
                    
                    backPatch(patch_line, get_lineNo());
                    setCode_End();
                    Gtable[fncTblNbr].frame = localAdrs;
                    
                    if (Gtable[fncTblNbr].name == "main"){
                        mainTblNbr = fncTblNbr;
                        if (Gtable[mainTblNbr].args != 0)
                            err_exit("main関数では仮引数を指定できません。");
                    }
                    fncDecl_F = false;
                }
void backPatch(int line, int n)
                {
                    *SHORT_P(intercode[line] + 1) = (short)n;
                }

void setCode(int cd)
                {
                    *codebuf_p++ = (char) cd;
                }

int setCode(int cd, int nbr)
                {
                    *codebuf_p++ = (char)cd;
                    *SHORT_P(codebuf_p) = (short)nbr; codebuf_p += SHORT_SIZ;
                    return get_lineNo();
                }

void setCode_rest()
                {
                    extern char *token_p;
                    strcpy(codebuf_p, token_p);
                    codebuf_p += strlen(token_p)+1;
                }

void setCode_End()
                {
                    if (token.kind != End) err_exit(err_msg(token.text, "end"));
                    setCode(End); token = nextTkn(); setCode_EofLine();
                }

vose setCode_EofLine()
                {
                    if (token.kind != EofLine) err_exit("不正な記述です: ", token.text);
                    push_intercode();
                    token = nextLine_tkn();
                }

void push_intercode()
                {
                    int len;
                    char *p
                    
                    *codebuf_p++ = '\0';
                    if (( len = codebuf_p-codebuf) >= LIN_SIZ)
                        err_exit("返還後の内部コードが長すぎます。式を短くしてください。");
                    
                    try {
                        p = new char[len];
                        memcpy(p, codebuf, len);
                        intercode.push_back(p);
                    }
                    catch (bad_alloc){err_exit("メモリ確保できません");}
                    codebuf_p = codebuf;
                }

bool is_localScope()
                {
                    return fncDecl_F;
                }

bbi.cpp

/**************************************/
/*  filename:bbi.cppメイン処理         */
/*  BBIインタプリタ                     */
/**************************************/
#include "bbi.h"
#include "bbi_prot.h"

int main(int argc, char *argv[])
{
    if(argc == 1){ cout << "用法:bbi filename\n"; exit(1);}
    convert_to_internalCode(argv[1]);
    syntaxChk();
    execute();
    return 0;
}