- html - 出于某种原因,IE8 对我的 Sass 文件中继承的 html5 CSS 不友好?
- JMeter 在响应断言中使用 span 标签的问题
- html - 在 :hover and :active? 上具有不同效果的 CSS 动画
- html - 相对于居中的 html 内容固定的 CSS 重复背景?
<分区>
我正在创建一个符号表类,以与我为编译器类(class)编写的分析器/解析器一起使用。到目前为止一切都很顺利,但我无法使用 g++ 在我学校的 Linux 机器上编译这些类文件:
符号表.h:
// Multiple definition guard
#ifndef SYMBOLTABLE_H
#defineSYMBOLTABLE_H
// Includes
#include <iostream>
#include <string>
#include "stddef.h"
// Namespace
using namespace std;
// Class for storing all encountered symbols while parsing
class SymbolTable
{
public:
SymbolTable(); // Constructor
~SymbolTable(); // Destructor
void scopeUp(); // Increases current scope
void scopeDown(); // Decreases current scope
void addSymbol(string symbolTitle); // Adds a symbol to table
void addSymboll(string symbolTitle); // g++ doesn't think this exists
private:
int scope;
// Structure for storing symbols. Currently only contains title from
// identifier. Will expand upon / derive from this structure after
// initial testing. Symbols are stored in a simple stack, with the
// container class responsible for keeping track of the top Symbol.
struct Symbol
{
Symbol* previousSymbol;
string title;
};
// Structure for tracking current scope. All symbols will belong to a
// particular scope, and are stored in a simple stack to maintain
// declaration order. When the scope changes, currentScope will point to
// a new scope structure with its own list of symbols. Scopes themselves
// are also stored in a stack, where currentScope points to the top.
struct Scope
{
Scope* previousScope;
Symbol* currentSymbol;
};
Scope* currentScope;
// This is a recursive display function used for printing all of the items
// in a given scope. This is called from within the scopeDown function, so
// that the final list of items for that scope can be logged before it is
// destroyed
void displayScope(Symbol* displaySymbol);
};
#endif // Multiple definition guard
符号表.cpp:
// Multiple definition guard
#ifndef SYMBOLTABLE_CPP
#define SYMBOLTABLE_CPP
// Includes
#include "SymbolTable.h"
// Constructor
SymbolTable::SymbolTable()
{
scope = 0;
currentScope = NULL;
return;
}
// Destructor
SymbolTable::~SymbolTable()
{
Scope* nextScopeToDelete = NULL;
Symbol* nextSymbolToDelete = NULL;
// While there are scopes left to delete from the table...
while(currentScope != NULL)
{
// Save the pointer to the next scope on the stack
nextScopeToDelete = currentScope->previousScope;
// While there are symbols left to delete from the scope...
while(currentScope->currentSymbol != NULL)
{
// Save the pointer to the next symbol on the stack
nextSymbolToDelete = currentScope->currentSymbol->previousSymbol;
// For debugging
cout << "deleting symbol " << currentScope->currentSymbol->title << endl;
// Delete the current top symbol
delete currentScope->currentSymbol;
// Move on to the next one
currentScope->currentSymbol = nextSymbolToDelete;
}
// For debugging
cout << "deleting scope " << scope << endl;
// Delete the current top scope
delete currentScope;
scope--;
// Move on to the next one
currentScope = nextScopeToDelete;
}
return;
}
// This is a recursive display function used for printing all of the items
// in a given scope. This is called from within the scopeDown function, so
// that the final list of items for that scope can be logged before it is
// destroyed
void SymbolTable::displayScope(Symbol* displaySymbol)
{
// If we've reached the bottom of the scope stack...
if(displaySymbol == NULL)
{
return; // Nothing to do
}
// We haven't reached the bottom of the scope stack
else
{
displaySymbol = displaySymbol->previousSymbol; // Keep going
displayScope(displaySymbol); // Recursive call
}
// Display this symbol after all lower ones have been displayed recursively
cout << displaySymbol->title << endl;
return;
}
// A new procedure has caused us to increase scope, so we'll create a new
// scope structure with its own symbol stack
void SymbolTable::scopeUp()
{
// Generate the new scope structure
Scope* newScope = new Scope;
newScope->previousScope = currentScope;
newScope->currentSymbol = NULL;
// Notification for debugging
cout << "ENTERING SCOPE " << scope + 1 << endl;
cout << "--------------------------------------------------";
cout << "-------------------------" << endl;
// Switch to the new scope
currentScope = newScope;
scope++;
return;
}
// The end of a procedure has caused us to decrement scope, so we'll delete
// the contents of the current one and fall back to the last scope on the stack
void SymbolTable::scopeDown()
{
// If we're already at the bottom of the stack...
if(currentScope == 0)
{
// Something is very wrong
cerr << "CANNOT DELETE SCOPE 0!!!!" << endl;
}
else
{
// Save the pointer to the next scope on the stack
Scope* previousScope = currentScope->previousScope;
Symbol* nextSymbolToDelete = NULL;
// Display the contents of this scope before deleting it (debugging)
displayScope(currentScope->currentSymbol);
// While there are still symbols in this scope to delete...
while(currentScope->currentSymbol != NULL)
{
// Save the pointer to the next symbol on the stack
nextSymbolToDelete = currentScope->currentSymbol->previousSymbol;
// Delete the current top symbol on the stack
delete currentScope->currentSymbol;
// Move on to the next one
currentScope->currentSymbol = nextSymbolToDelete;
}
// Notification for debugging
cout << "EXITING SCOPE " << scope-- << endl;
cout << "==================================================";
cout << "=========================" << endl;
// Delete the old top scope from the stack
delete currentScope;
// Move on to the next one
currentScope = previousScope;
}
return;
}
// Adds a symbol to the table. Specifically: adds a symbol to the top of the
// symbol stack in the scope at the top of the scope stack. This will soon be
// interfacing with more expansive data structure, but currently just stores
// the title of the symbol as detected in the parser.
void SymbolTable::addSymbol(string symbolTitle)
{
Symbol* newSymbol = new Symbol;
newSymbol->previousSymbol = currentScope->currentSymbol;
newSymbol->title = symbolTitle;
currentScope->currentSymbol = newSymbol;
return;
}
// g++ doesn't think this was declared in the class
void SymbolTable::addSymboll(string symbolTitle)
{
Symbol* newSymbol = new Symbol;
newSymbol->previousSymbol = currentScope->currentSymbol;
newSymbol->title = symbolTitle;
currentScope->currentSymbol = newSymbol;
return;
}
#endif // Multiple definition guard
错误:
[...]$ touch SymbolTable.h SymbolTable.cpp
[...]$ g++ -c SymbolTable.cpp
SymbolTable.cpp:67: error: no âvoid SymbolTable::displayScope(SymbolTable::Symbol*)â member function declared in class âSymbolTableâ
SymbolTable.cpp:167: error: no âvoid SymbolTable::addSymboll(std::string)â member function declared in class âSymbolTableâ
[...]$
据我所知,它似乎认为我的 displayScope 函数没有在类头文件中声明。为了进一步研究这一点,我添加了一个名为 addSymboll 的新函数,它与现有的 addSymbol 函数相同。但是,对于这个新功能,它给了我同样的错误信息。事实上,在花了几个小时尝试编译之后,似乎我根本无法向此类添加任何新功能。我完全不知道是什么原因造成的。 如有任何想法,我们将不胜感激!
我目前正在尝试让 g++ 工作,并查看 http://gcc.gnu.org/install/build.html ,我似乎找不到它在哪里说如何“执行编译器的 3 阶段 bootstrap ”。我在哪
James Powell 在他对即将举行的演示文稿的简短描述中说,他自豪地发明了最粗糙的 Python 单行代码之一: (None for g in g if (yield from g) and F
请告诉我我的证明是否正确 We have a connected graph, and specific vertex u in V(G). Suppose we compute the dfs tr
下面的test2和test3结果是不同的。 我对此感到困惑,因为它看起来像相同的逻辑,并且与linux bash ||逻辑不同。 $data = @( [PSCustomObject]@{St
我试图找到一个明确的 G 代码语法规范,而不是单个 G 代码的含义,我无处不在的规范,我的意思是详细的语法规范,目的是编写解析器。 我编写解析器没有问题,我只是在寻找语法规范,例如。我知道您不必总是为
我写了这个 mixin,但它循环了很多时间。你能帮我优化我的代码吗?或者你能建议一些其他的东西来获得想要的结果吗? dfgdfgsdfgsdf 最佳答案 希望这就是您要找的。 $spaces: (4,
默认情况下,g++ 似乎会省略未使用的类内定义方法的代码。示例 from my previous question : struct Foo { void bar() {} void baz(
是否可以将文件内容通过管道传送到 g++编译程序? 我想这样做是因为我想使用数据库中的文件而不是磁盘上的物理文件。可以通过我制作的 API 轻松检索文件内容。 例如,我想做这样的事情: g++ con
如何profile c++代码获取每行代码的调用次数和消耗时间,就像profile工具一样在 Matlab 中呢? 我尝试使用-fprofile-arcs之类的东西,但它只生成代码覆盖率报告,其中可以
如何在几行代码上禁用所有警告。可以使用 GCC 诊断功能禁用特定警告,但是否有针对所有警告的标志。我尝试了这个方法,但不起作用 #pragma GCC diagnostic push #pragma
我有一个链接到 opencv 2.2 的可执行文件。但是,我删除了 opencv 2.2 并安装了 opencv 2.3。 问题是,有没有办法在不重新编译整个源代码的情况下将这个可执行文件链接到新的共
在编译带有一些标志的以下文件时,是否可以让 g++ 显示错误? #include using namespace std; int main() { int arr[ 2 ]; cout
在学习 Haskell 时,我遇到了一个挑战,要找到两个函数 f 和 g,例如 f g 和 f 。 g 是等价的(并且是总计,因此像 f = undefined 或 f = (.) f 这样的东西不算
根据我的理解,Theta 位于 Big O 和 Omega 之间,但我看到了这个声明,但我无法理解为什么交集会出现在这里。我能否对 Θ(g(n)) = O(g(n)) ∩ Ω(g(n)) 获得数学和分
我需要为这个递归函数编写一个迭代函数。 int funcRec(int n){ if(n>1) { return 2*funcRec(n - 1) + 3*funcRec(n
我在 github repository 上有代码示例并在 travis-ci 上创建了一个构建便于复制。 最小的、完整的和可验证的例子 可能不是最小的,但我相信它足够小 它使用 boost.inte
编辑:我们将调用箭头 p纯如果存在这样的函数f即:p = arr f . 我试图更好地掌握 Haskell 中的 Arrows,我想弄清楚什么时候 f >>> (g &&& h) = (f >>> g
我有两个(或更多)函数定义为: val functionM: String => Option[Int] = s => Some(s.length) val functionM2: Int => Op
好像是的。任何直观或严肃的证据都值得赞赏。 最佳答案 没有。 我认为您的问题等同于:给定函数 f 和 g,f 是 O(g) 或 g 是 O(f) 是否总是正确的?这在 SE Computer Scie
如果我设法证明 f(n) = o(g(n))(小 o),那么这两个函数的总和 f( n) + g(n) 应该被“更大”的函数 g(n) 紧紧束缚。 然而,我在证明这一点时遇到了一些麻烦。 最佳答案 以
我是一名优秀的程序员,十分优秀!