C++手工编写词法分析器

#include <iostream> #include <vector> #include <queue> using namespace std; int main() { priority_queue<int, vector<int>,greater<int> > que; cout<<"Values put into priority_queue"<<endl; que.push(100); que.push(500); que.push(600); que.push(400); que.push(700); cout<<"Values pop form stack"<<endl; for(int i=que.size();i>0;i--) { cout<<que.top()<<endl; que.pop(); } system("pause"); return 0; }