C++ 符号表

28 Aug 2024 | 5 分钟阅读

在本文中，您将学习 C++ 中的符号表。

编译器设计符号表

为了存储有关不同<强>实体（例如<强>变量和<强>函数名、<强>对象和<强>类等）存在的信息，编译器构建并维护一个数据结构。符号表是数据结构的一种。

C++ 符号表条目代码

示例

#include <iostream>
#include <unordered_map>
#include <vector>

class SymbolTableEntry {
public:
std::string name;
std::string dataType;
std::string scope;

SymbolTableEntry(const std::string& n, const std::string& dt, const std::string&sc)
        : name(n), dataType(dt), scope(sc) {}
};

class SymbolTable {
public:
    void insert(constSymbolTableEntry& entry) {
entries.push_back(entry);
    }

SymbolTableEntry* lookup(const std::string& name) {
        for (auto&entry : entries) {
            if (entry.name == name) {
                return &entry;
            }
        }
        return nullptr;
    }

private:
std::vector<SymbolTableEntry> entries;
};

int main() {
SymbolTablesymbolTable;

symbolTable.insert(SymbolTableEntry("A", "int", "P1"));
symbolTable.insert(SymbolTableEntry("B", "int", "P1"));
symbolTable.insert(SymbolTableEntry("C", "int", "P1 inner block"));
symbolTable.insert(SymbolTableEntry("D", "int", "P1 inner block"));
symbolTable.insert(SymbolTableEntry("E", "int", "P1"));
symbolTable.insert(SymbolTableEntry("F", "int", "P1 inner block"));
symbolTable.insert(SymbolTableEntry("G", "int", "P1 inner block"));
symbolTable.insert(SymbolTableEntry("H", "int", "P2"));
symbolTable.insert(SymbolTableEntry("I", "int", "P2"));
symbolTable.insert(SymbolTableEntry("J", "int", "P2 inner block"));
symbolTable.insert(SymbolTableEntry("K", "int", "P2 inner block"));
symbolTable.insert(SymbolTableEntry("L", "int", "P2"));

SymbolTableEntry* entryA = symbolTable.lookup("A");
    if (entryA) {
std::cout<< "Found symbol A in the symbol table." <<std::endl;
    } else {
std::cout<< "Symbol A not found in the symbol table." <<std::endl;
    }

SymbolTableEntry* entryX = symbolTable.lookup("X");
    if (entryX) {
std::cout<< "Found symbol X in the symbol table." <<std::endl;
    } else {
std::cout<< "Symbol X not found in the symbol table." <<std::endl;
    }

    return 0;
}

输出

Found symbol A in the symbol table.
Symbol X not found in the symbol table.

符号表操作

C++ 中有几种符号表操作。C++ 中的一些主要符号表操作如下：

操作符号表。

一个<强>符号表可以使用<强>分配操作来分配一个全新的、<强>空符号表。

符号表上的插入操作

一个<强>符号表的插入操作可用于<强>插入一个<强>名称并返回指向该条目的指针。

符号表上的 Set_attribute 操作

<强>Set_attribute 是一个符号表，可以对其进行操作以将属性与特定条目关联。

符号表上的 Get_attribute 操作

<强>Get_attribute 是一个符号表，可以对其进行操作以获取与特定条目关联的属性。

符号表上的查找操作

<强>查找符号表上的操作可用于查找<强>名称并返回指向其条目的<强>指针。

符号表上的 Free 操作

通过执行<强>Free 操作以删除所有条目，可以释放<强>符号表的存储空间。在符号表上，可以以类似的方式执行其他操作以删除操作。

符号表的部署

可以使用各种数据结构方法实现符号表。列出了以下技术：

LinkedList
哈希表
Tree

使用哈希在 C++ 中实现符号表

// Symbol Table implementation in C++ 

#include <iostream>
using namespace std; 

const int MAXIMUM = 200; 

class Node { 

	string identifier, scope, type; 
	int Line_Number; 
	Node* next_Node; 

public: 
	Node() 
	{ 
		next_Node = NULL; 
	} 

	Node(string key, string value, string type, int Line_Number) 
	{ 
		this->identifier = key; 
		this->scope = value; 
		this->type = type; 
		this->Line_Number = Line_Number; 
		next_Node = NULL; 
	} 

	void print() 
	{ 
		cout<< "Identifier's Name:" << identifier 
			<< "\nType:" << type 
			<< "\nScope: " << scope 
			<< "\nLine Number: " <<Line_Number<<endl; 
	} 
	friend class SymbolTable; 
}; 

class SymbolTable { 
	Node* header[MAXIMUM]; 

public: 
	SymbolTable() 
	{ 
		for (int i = 0; i< MAXIMUM; i++) 
			header[i] = NULL; 
	} 

	int hashf(string id); // hash function 
	bool JavaTpoint_insertion(string id, string scope, 
				string Type, int Line_Number); 

	string JavaTpoint_search(string id); 

	bool deleteRecord(string id); 

	bool modify(string id, string scope, 
				string Type, int Line_Number); 
}; 

// Identifyer modification function 

bool SymbolTable::modify(string id, string s, 
						string t, int l) 
{ 
	int index = hashf(id); 
	Node* start = header[index]; 

	if (start == NULL) 
		return "-1"; 

	while (start != NULL) { 
		if (start->identifier == id) { 
			start->scope = s; 
			start->type = t; 
			start->Line_Number = l; 
			return true; 
		} 
		start = start->next_Node; 
	} 

	return false; // id not found 
} 

// Delete an identifier function

bool SymbolTable::deleteRecord(string id) 
{ 
	int index = hashf(id); 
	Node* JavaTpoint_Temporary_Variable = header[index]; 
	Node* par = header[index]; 

	// There is no identifier at that index. 

	if (JavaTpoint_Temporary_Variable == NULL) { 
		return false; 
	} 
	// There is only one identifier. 

	if (JavaTpoint_Temporary_Variable->identifier == id &&JavaTpoint_Temporary_Variable->next_Node == NULL) { 
		JavaTpoint_Temporary_Variable->next_Node = NULL; 
		delete JavaTpoint_Temporary_Variable; 
		return true; 
	} 

	while (JavaTpoint_Temporary_Variable->identifier != id &&JavaTpoint_Temporary_Variable->next_Node != NULL) { 
		par = JavaTpoint_Temporary_Variable; 
		JavaTpoint_Temporary_Variable = JavaTpoint_Temporary_Variable->next_Node; 
	} 
	if (JavaTpoint_Temporary_Variable->identifier == id &&JavaTpoint_Temporary_Variable->next_Node != NULL) { 
		par->next_Node = JavaTpoint_Temporary_Variable->next_Node; 
		JavaTpoint_Temporary_Variable->next_Node = NULL; 
		delete JavaTpoint_Temporary_Variable; 
		return true; 
	} 

	// remove the conclusion
	else { 
		par->next_Node = NULL; 
		JavaTpoint_Temporary_Variable->next_Node = NULL; 
		delete JavaTpoint_Temporary_Variable; 
		return true; 
	} 
	return false; 
} 

// JavaTpoint_search identifier function 

string SymbolTable::JavaTpoint_search(string id) 
{ 
	int index = hashf(id); 
	Node* start = header[index]; 

	if (start == NULL) 
		return "-1"; 

	while (start != NULL) { 

		if (start->identifier == id) { 
			start->print(); 
			return start->scope; 
		} 

		start = start->next_Node; 
	} 

	return "-1"; // not found 
} 

// JavaTpoint_insertion function for an identifier  
bool SymbolTable::JavaTpoint_insertion(string id, string scope, 
						string Type, int Line_Number) 
{ 
	int index = hashf(id); 
	Node* p = new Node(id, scope, Type, Line_Number); 

	if (header[index] == NULL) { 
		header[index] = p; 
		cout<< "\n"
			<< id << " insertion"; 

		return true; 
	} 

	else { 
		Node* start = header[index]; 
		while (start->next_Node != NULL) 
			start = start->next_Node; 

		start->next_Node = p; 
		cout<< "\n"
			<< id << " insertion"; 

		return true;  
	} 
	return false; 
} 
int SymbolTable::hashf(string id) 
{ 
	int asciiSum = 0; 

	for (int i = 0; i<id.length(); i++) { 
		asciiSum = asciiSum + id[i]; 
	} 
	return (asciiSum % 100); 
} 
int main() 
{ 
	SymbolTablest; 
	string check; 
	cout<< "**** SYMBOL_TABLE ****\n"; 

	if (st.JavaTpoint_insertion("if", "local", "keyword", 4)) 
		cout<< " -successfully"; 
	else
		cout<< "\nFailed to JavaTpoint_insertion.\n"; 

	if (st.JavaTpoint_insertion("number", "global", "variable", 2)) 
		cout<< " -successfully\n\n"; 
	else
		cout<< "\nFailed to JavaTpoint_insertion\n"; 

	check = st.JavaTpoint_search("if"); 
	if (check != "-1") 
		cout<< "Identifier Is present\n"; 
	else
		cout<< "\nIdentifier Not Present\n"; 

	if (st.deleteRecord("if")) 
		cout<< "if Identifier is deleted\n"; 
	else
		cout<< "\nFailed to delete\n"; 

	if (st.modify("number", "global", "variable", 3)) 
		cout<< "\nNumber Identifier updated\n"; 

	check = st.JavaTpoint_search("number"); 
	if (check != "-1") 
		cout<< "Identifier Is present\n"; 
	else
		cout<< "\nIdentifier Not Present"; 
	return 0; 
}

输出

**** SYMBOL_TABLE ****

if insertion -successfully
number insertion -successfully

Identifier's Name:if
Type:keyword
Scope: local
Line Number: 4
Identifier Is present
if Identifier is deleted

Number Identifier updated
Identifier's Name:number
Type:variable
Scope: global
Line Number: 3
Identifier Is present

结论

<强>符号表是语言处理系统的重要工具，它提供管理 C 程序中标识符复杂语义和行为的基本基础设施。它对于确保代码正确高效地执行至关重要。

下一个主题C++ 中的 tellp() 函数

C++ 符号表

编译器设计符号表

C++ 符号表条目代码

符号表操作

符号表的部署

结论

联系信息

关注我们

教程

面试题

在线编译器

Python

Java

.Net Framework

AI, ML and Data Science

Cloud Technology

B.Tech and MCA

Web Technology

PHP

Software Testing

Technical Interview

Java Interview

Python

Web Interview

Database Interview

B.Tech / MCA

Important Interview

Software Testing Interview

Company Interviews

Online Compilers

Multiple Choice Questions

C++ 教程

C++ 控制语句

C++ 函数

C++ 数组

C++ 类和对象

C++ 构造函数

C++ 继承

C++ 多态

C++ 抽象

C++ 命名空间

C++ 模板

C++ 字符串

C++ 指针

信号处理

C++ 异常

C++ 文件与流

C++ STL 教程

面试题

选择题

C++ 程序

C++ STL Stack

C++ STL Bitset

C++ STL Deque

C++ STL List

C++ STL Map

C++ STL Math

C++ STL priority_queue

C++ STL Queue

C++ STL Multiset

C++ STL Multimap

C++ STL Set

C++ STD Strings

C++ STL Vector

C++ 操纵符

C++ STL Algorithms

C++ Algorithm

C++ Iterators

C++ 杂项

C++ 符号表

编译器设计符号表

C++ 符号表条目代码

符号表操作

符号表的部署

结论

相关帖子

C/C++ 断言

C++ Stoi 函数

C++ 析构函数的特点

C++ 程序计算矩阵的行列式

现代 C++ 中 STL 算法的执行策略

C++ 重新抛出异常

C++ 计算器程序

C++ 密码验证

C++ 阶乘程序

DOSBox Turbo C++

订阅 Tpoint Tech

联系信息

关注我们

教程

面试题