|
Precedence Protocols)
- 제안 : Ramanathan et al., ICSE '07
- 방법 : Frequent Subsequence Mining
- 문제점 : Data흐름 or 종속관계를 고려하지 않음
4) 무시된 조건 검출(Revealing Neglected Conditions)
- 제안 : Chang et al., ISSTA'07
- 방법 : Frequent Itemset mining
|
|
|
#include<stdio.h>
#include<process.h>
#include<string.h>
#define MAX_STACK_SIZE 100
#define MAX_EXPR_SIZE 100
typedef enum{lparen,rparen,plus,minue,times,divide,mod,eos,operand} precedence;
precedence stack[MAX_STACK_SIZE];
char expr[MAX_EXPR_SIZE];
static int isp[]={0,19,1
|
|
|
rn minus;
case \'/\' : return divide;
case \'*\' : return times;
case \'%\' : return mode;
case \'\\0\' : return eos;
default : return operand;
}
}
char print_token(precedence item){ /* return char value about each precedence type */
switch(item){
case lparen : return \'(\';
case rparen : return \')
|
|
|
|
#include <stdio.h>
#include <string.h>
#define MAX_STACK_SIZE 100 // stack의최대크기
#define MAX_EXPR_SIZE 100 // 수식의최대크기
/* 사용될operation */
typedef enum {
lparen, rparen, uplus, uminus, power, times, divide, mod, plus, minus, eos, operand
}precedence;
/* Token(연
|
|
|
|
precedence;
precedence stack[MAX_SIZE];
// isp와 icp 배열
static int isp[] = {0,19,12,12,13,13,13,0,0,14,14,14,15,15};
static int icp[] = {20,19,12,12,13,13,13,0,0,14,14,14,15,15};
char expr[MAX_SIZE]; // 값을 입력
char change_exprs[MAX_SIZE]; // 값을 해결하는 배열로 변
|
|
메뉴펼치기
