sravan/system76-edk2
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

BaseTools: Various typo

Browse Source 
Various typo in BaseTools.

Contributed-under: TianoCore Contribution Agreement 1.1
Signed-off-by: Coeur <coeur@gmx.fr>
Reviewed-by: Liming Gao <liming.gao@intel.com>
This commit is contained in:
Antoine Coeur
2019-02-06 15:44:39 +08:00
committed by Liming Gao
parent 325ad62260
commit fb0b35e05f
172 changed files with 510 additions and 515 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
BaseTools/Source/C/VfrCompile/Pccts/dlg/automata.c
View File

@@ -90,7 +90,7 @@ set nfa_states;
if (dfa_size<=dfa_allocated){
/* need to redo array */
if (!dfa_array){
/* need some to do inital allocation */
/* need some to do initial allocation */
dfa_size=dfa_allocated+DFA_MIN;
dfa_array=(dfa_node **) malloc(sizeof(dfa_node*)*
dfa_size);
@@ -113,7 +113,7 @@ set nfa_states;
}
/* past a pointer to the start start of the nfa graph
/* past a pointer to the start of the nfa graph
* nfa_to_dfa convers this graph to dfa. The function returns
* a pointer to the first dfa state.
* NOTE: The function that prints out the table will have to figure out how
@@ -219,7 +219,7 @@ FILE *f;
#endif
/* Returns a pointer to a dfa node that has the same nfa nodes in it.
* This may or maynot be a newly created node.
* This may or may not be a newly created node.
*/
dfa_node *
#ifdef __USE_PROTOS

4
BaseTools/Source/C/VfrCompile/Pccts/dlg/dlg.h
View File

@@ -117,7 +117,7 @@ typedef struct {
extern char program[]; /* tells what program this is */
extern char version[]; /* tells what version this is */
extern char *file_str[]; /* file names being used */
extern int err_found; /* flag to indicate error occured */
extern int err_found; /* flag to indicate error occurred */
extern int action_no; /* last action function printed */
extern int func_action; /* should actions be turned into functions?*/
extern set used_chars; /* used to label trans. arcs */
@@ -129,7 +129,7 @@ extern int comp_level; /* what compression level to use */
extern int interactive; /* interactive scanner (avoid lookahead)*/
extern int mode_counter; /* keeps track of the number of %%name */
extern int dfa_basep[]; /* start of each group of dfa */
extern int dfa_class_nop[];/* number of transistion arcs in */
extern int dfa_class_nop[];/* number of transition arcs in */
/* each dfa in each mode */
extern int nfa_allocated;
extern int dfa_allocated;

51
BaseTools/Source/C/VfrCompile/Pccts/dlg/dlg.r
View File

@@ -23,9 +23,9 @@ resource 'cmdo' (128, "Dlg") {
{35, 175, 50, 225},
"On",
"-CC",
"When this control is checked, DLG genera"
"tes a scanner using C++ classes rather t"
"han C functions."
"When this control is checked, DLG generates "
"a scanner using C++ classes rather than "
"C functions."
},
/* [2] */
Or {
@@ -41,8 +41,7 @@ resource 'cmdo' (128, "Dlg") {
"DLGLexer",
keepCase,
"-cl",
"This entry specifies the name DLG uses f"
"or the C++ lexer class."
"This entry specifies the name DLG uses for the C++ lexer class."
},
/* [3] */
NotDependent {
@@ -90,8 +89,7 @@ resource 'cmdo' (128, "Dlg") {
{66, 25, 85, 135},
"Output File",
"",
"Choose the name of the file that will ho"
"ld the DLG-produced scanner."
"Choose the name of the file that will hold the DLG-produced scanner."
},
NoMore {
@@ -161,8 +159,7 @@ resource 'cmdo' (128, "Dlg") {
"mode.h",
keepCase,
"-m",
"This entry specifies the name DLG uses f"
"or its lexical mode output file."
"This entry specifies the name DLG uses for its lexical mode output file."
},
/* [11] */
NotDependent {
@@ -171,15 +168,14 @@ resource 'cmdo' (128, "Dlg") {
RadioButtons {
{ /* array radioArray: 3 elements */
/* [1] */
{134, 175, 149, 255}, "None", "", Set, "When this option is selected, DLG will n"
"ot compress its tables.",
{134, 175, 149, 255}, "None", "", Set, "When this option is selected, DLG will not "
"compress its tables.",
/* [2] */
{134, 265, 149, 345}, "Level 1", "-C1", NotSet, "When this option is selected, DLG will r"
"emove all unused characters from the tra"
"nsition-from table.",
{134, 265, 149, 345}, "Level 1", "-C1", NotSet, "When this option is selected, DLG will "
"remove all unused characters from the transition-from table.",
/* [3] */
{134, 360, 149, 450}, "Level 2", "-C2", NotSet, "When this option is selected, DLG will p"
"erform level 1 compression plus it will "
{134, 360, 149, 450}, "Level 2", "-C2", NotSet, "When this option is selected, DLG will "
"perform level 1 compression plus it will "
"map equivalent characters into the same "
"character classes."
}
@@ -202,8 +198,8 @@ resource 'cmdo' (128, "Dlg") {
{165, 20, 180, 145},
"Case Sensitive",
"-ci",
"When this control is checked, the DLG au"
"tomaton will treat upper and lower case "
"When this control is checked, the DLG automaton "
"will treat upper and lower case "
"characters identically."
},
/* [14] */
@@ -215,9 +211,8 @@ resource 'cmdo' (128, "Dlg") {
{165, 150, 180, 300},
"Interactive Scanner",
"-i",
"When this control is checked, DLG will g"
"enerate as interactive a scanner as poss"
"ible."
"When this control is checked, DLG will generate "
"as interactive a scanner as possible."
},
/* [15] */
NotDependent {
@@ -229,8 +224,8 @@ resource 'cmdo' (128, "Dlg") {
"Ambiguity Warnings",
"-Wambiguity",
"When this control is checked, DLG warns "
"if more than one regular expression coul"
"d match the same character sequence."
"if more than one regular expression could "
"match the same character sequence."
},
/* [16] */
NotDependent {
@@ -240,9 +235,9 @@ resource 'cmdo' (128, "Dlg") {
VersionString {
"1.33MR"
},
"PCCTS was written by Terence Parr, Russe"
"ll Quong, Will Cohen, and Hank Dietz: 19"
"89-1998. MPW port by Scott Haney.",
"PCCTS was written by Terence Parr, Russell "
"Quong, Will Cohen, and Hank Dietz: 1989-1998. "
"MPW port by Scott Haney.",
noDialog
},
/* [17] */
@@ -266,8 +261,8 @@ resource 'cmdo' (128, "Dlg") {
{142, 20, 157, 148},
"Generate ANSI C",
"-ga",
"When this control is checked, DLG genera"
"tes ANSI C compatible code."
"When this control is checked, DLG generates "
"ANSI C compatible code."
}
}
}

2
BaseTools/Source/C/VfrCompile/Pccts/dlg/dlg_p.c
View File

@@ -813,7 +813,7 @@ new_nfa_node()
if (nfa_size<=nfa_allocated){
/* need to redo array */
if (!nfa_array){
/* need some to do inital allocation */
/* need some to do initial allocation */
nfa_size=nfa_allocated+NFA_MIN;
nfa_array=(nfa_node **) malloc(sizeof(nfa_node*)*
nfa_size);

2
BaseTools/Source/C/VfrCompile/Pccts/dlg/dlg_p.g
View File

@@ -463,7 +463,7 @@ new_nfa_node()
if (nfa_size<=nfa_allocated){
/* need to redo array */
if (!nfa_array){
/* need some to do inital allocation */
/* need some to do initial allocation */
nfa_size=nfa_allocated+NFA_MIN;
nfa_array=(nfa_node **) malloc(sizeof(nfa_node*)*
nfa_size);

2
BaseTools/Source/C/VfrCompile/Pccts/dlg/relabel.c
View File

@@ -134,7 +134,7 @@ int level; /* compression level to uses */
/* given pointer to beginning of graph and recursively walks it trying
* to find a maximal partition. This partion in returned in maximal_class
* to find a maximal partition. This partition in returned in maximal_class
*/
#ifdef __USE_PROTOS
void intersect_nfa_labels(nfa_node* start,set* maximal_class)