編譯原理構(gòu)造LR0分析表

代碼已經(jīng)調(diào)試通刹帕，直接從實(shí)驗(yàn)報(bào)告復(fù)制粘貼來(lái)的，可能會(huì)有中文編碼問(wèn)題库物，調(diào)成utf-8就行侨核。


【實(shí)驗(yàn)名稱】?? ???????????LR（0）分析表的構(gòu)造????????? ????

【實(shí)驗(yàn)?zāi)康摹?/p>

?結(jié)合書本上P135面LR(0)分析表構(gòu)造知識(shí)，了解掌握LR（0）分析表構(gòu)造過(guò)程祈惶，從構(gòu)造閉包到構(gòu)造分析表雕旨。為后面LR系列的文法打下基礎(chǔ)扮匠。

【實(shí)驗(yàn)原理】

?假設(shè)構(gòu)造出來(lái)LR(0)項(xiàng)目規(guī)范族為C={I0,I1,IN},其中Ik為項(xiàng)目集名字，k為狀態(tài)名稱奸腺。S’->.S的項(xiàng)目的集合的Ik的下標(biāo)k為分析器初始狀態(tài)餐禁。分析表構(gòu)造如下

[if !supportLists]（1）?[endif]若項(xiàng)目A->a.ab屬于Ik并且轉(zhuǎn)換函數(shù)GO（Ik,a）=Ij,當(dāng)a為終結(jié)符時(shí)，置action[k,a]為Sj,動(dòng)作含義是將終結(jié)符號(hào)a移進(jìn)符號(hào)棧突照，狀態(tài)j進(jìn)入狀態(tài)棧（相當(dāng)于在狀態(tài)k時(shí)遇a轉(zhuǎn)向狀態(tài)j）帮非。

[if !supportLists]（2）?[endif]若項(xiàng)目A->a.屬于Ik,則對(duì)任何終結(jié)符a與#號(hào)置ACTION[k,a]和ACTION[k,#]為rj,j為文法中某個(gè)歸約產(chǎn)生式的序號(hào)。動(dòng)作含義是用A規(guī)約a讹蘑。并把狀態(tài)棧指針后移|a|位

[if !supportLists]（3）?[endif]若GOTO（Ik,A）=Ij,則置GOTO[k,A]為“j”,其中A為非終結(jié)符末盔，表示當(dāng)前狀態(tài)是“k”時(shí)候遇到文法符號(hào)A時(shí)應(yīng)該轉(zhuǎn)向j,因此A移入文法符號(hào)棧，j移入狀態(tài)棧座慰。

[if !supportLists]（4）?[endif]若項(xiàng)目“S’->S”屬于Ik,應(yīng)置ACTION[k,#]為acc,表示接受

[if !supportLists]（5）?[endif]凡不可用上述方法的陨舱，應(yīng)該報(bào)錯(cuò)。

【實(shí)驗(yàn)內(nèi)容】

1.首先要確定是LR（0）文法版仔，排除項(xiàng)目集中不應(yīng)該含有‘移進(jìn)-規(guī)約’或者‘歸約-規(guī)約’沖突游盲。這個(gè)自己設(shè)計(jì)一個(gè)簡(jiǎn)單文法就行

2. 從拓展文法之后的開始符開始，先求出閉包之后的項(xiàng)目集蛮粮，之后遍歷項(xiàng)目集找出所有活前綴點(diǎn)之后的非終結(jié)符與終結(jié)符益缎，找下一個(gè)項(xiàng)目集，如果有相同的非終結(jié)符然想，要把原來(lái)的項(xiàng)目集放入項(xiàng)目集族中莺奔，每次找下一個(gè)項(xiàng)目集都要檢驗(yàn)項(xiàng)目集是否已存在，直到遞歸找到所有非終結(jié)符的帶活前綴文法变泄。在此過(guò)程中令哟，檢驗(yàn)項(xiàng)目集中是否規(guī)約移進(jìn)同時(shí)存在，若存在會(huì)報(bào)錯(cuò)妨蛹。同時(shí)屏富，會(huì)把每個(gè)項(xiàng)目集之間的聯(lián)系記錄下來(lái)，用于分析表的構(gòu)建蛙卤。

【小結(jié)或討論】

這次實(shí)驗(yàn)比較困難狠半，需要結(jié)合一些習(xí)題來(lái)熟悉構(gòu)造過(guò)程。還應(yīng)該和后面的SLR文法表窘，LR1文法典予，LALR1文法聯(lián)系起來(lái)看甜滨，其實(shí)LR（0）文法是一個(gè)理想化的情況乐严，因此文法構(gòu)建的就比較簡(jiǎn)單才能驗(yàn)證。

【實(shí)驗(yàn)截圖】

文法：

S’->S

S->A

A->aA

A->b

結(jié)果是正確的衣摩，在第一個(gè)產(chǎn)生式“S->A”中接受最后的規(guī)約昂验，acc


代碼：

#include

<iostream>

#include

<cstdio>

#include

<algorithm>

#include

<cstring>

#include

<cctype>

#include

<vector>

#include

<string>

#include

<queue>

#include

<map>

#include

<sstream>

#define MAX 507

#define DEBUG


using namespace std;


class WF

{

??? public:

??? string left,right;

??? int back;

??? int id;

??? WF( char s1[] , char s2[] , int x , int y )

??? {

??????? left= s1;

??????? right= s2;

??????? back= x;

??????? id= y;

??? }

??? WF( const string& s1 , const string& s2 , int x , int y )

??? {

??????? left= s1;

??????? right= s2;

??????? back= x;

??????? id= y;

??? }

??? bool operator < ( const WF& a ) const

??? {

??????? if ( left == a.left )

??????????? return right < a.right;

??????? return left < a.left;

??? }

??? bool operator == ( const WF& a ) const

??? {

??????? return ( left == a.left )&& ( right == a.right );

??? }

??? void print ( )

??? {

??????? printf( "%s->%s\n" , left.c_str() , right.c_str() );

??? }

};


class Closure

{

??? public:

??? vector<WF> element;

??? void print ( string str )

??? {

??????? printf( "%-15s%-15s\n" , "" , str.c_str());

??????? for ( int i = 0 ; i < element.size() ; i++ )

??????????? element[i].print();

??? }

??? bool operator == ( const Closure& a ) const

??? {

??????? if ( a.element.size() != element.size() ) return false;

??????? for ( int i = 0 ; i < a.element.size() ; i++ )

??????????? if ( element[i] == a.element[i] ) continue;

??????????? else return false;

??????? return true;

??? }

};


struct Content

{

??? int type;

??? int num;

??? string out;

??? Content(){ type = -1; }

??? Content( int a , int b )

??????? :type(a),num(b){}

};


vector<WF> wf;

map<string,vector<int> > dic;

string start = "S";

vector<Closure> collection;

vector<WF> items;

char CH = '$';

int go[MAX][MAX];

int to[MAX];

vector<char> V;

bool used[MAX];

Content action[MAX][MAX];

int Goto[MAX][MAX];


void make_item ( )

{

??? memset( to , -1 , sizeof ( -1 ) );

??? for ( int i = 0 ; i < wf.size() ; i++ )

??????? for ( int j = 0 ; j <= wf[i].right.length() ; j++ )

??????? {

??????????? string temp= wf[i].right;

??????????? temp.insert ( temp.begin()+j , CH );

??????????? dic[wf[i].left].push_back ( items.size() );

??????????? if ( j )

??????????????? to[items.size()-1] = items.size();

??????????? items.push_back ( WF ( wf[i].left , temp , i , items.size()) );

??????? }

#ifdef DEBUG

#endif

}


void make_set ( )

{

??? bool has[MAX];

??? for ( int i = 0 ; i < items.size() ; i++ )

??????? if ( items[i].left[0] == 'S' && items[i].right[0] == CH )

??????? {

??????????? Closure temp;

??????????? string& str = items[i].right;

??????????? vector<WF>& element = temp.element;

??????????? element.push_back ( items[i] );

??????????? int x = 0;

??????????? for ( x = 0 ; x < str.length() ; x++ )

??????????????? if ( str[x] == CH )

??????????????????? break;

??????????? memset( has , 0 , sizeof ( has ) );

??????????? has[i] = 1;

??????????? if ( x != str.length()-1 )

??????????? {

??????????????? queue<string> q;

??????????????? q.push( str.substr(x+1,1) );

??????????????? while ( !q.empty() )

??????????????? {

??????????????????? string u= q.front();

??????????????????? q.pop();

??????????????????? vector<int>& id = dic[u];

??????????????????? for( int j = 0 ; j < id.size() ; j++ )

??????????????????? {

??????????????????????? int tx = id[j];

??????????????????????? if ( items[tx].right[0] == CH )

??????????????????????? {??

??????????????????????????? if ( has[tx] ) continue;

??????????????????????????? has[tx] = 1;

??????????????????????????? if ( isupper(items[tx].right[1] ) )

??????????????????????????????? q.push ( items[tx].right.substr(1,1));

??????????????????????????? element.push_back ( items[tx] );

??????????????????????? }???

??????????????????? }

??????????????? }

??????????? }

??????????? collection.push_back ( temp );

??????? }

??? for ( int i = 0 ; i < collection.size() ; i++ )

??? {

??????? map<int,Closure> temp;

??????? for ( int j = 0 ; j < collection[i].element.size() ; j++ )

??????? {

??????????? string str= collection[i].element[j].right;

??????????? int x = 0;

??????????? for ( ; x < str.length() ; x++ )

?????????????? if ( str[x] == CH ) break;

??????????? if ( x == str.length()-1 )

??????????????? continue;

??????????? int y = str[x+1];

??????????? int ii;

??????????? str.erase ( str.begin()+x);

??????????? str.insert ( str.begin()+x+1 , CH );

??????????? WF cmp= WF ( collection[i].element[j].left , str , -1 , -1 );

??????????? for ( int k = 0 ; k< items.size() ; k++ )

??????????????? if ( items[k] == cmp )

??????????????? {

??????????????????? ii= k;

??????????????????? break;

??????????????? }

???????????? memset( has , 0 , sizeof ( has ) );

???????????? vector<WF>& element = temp[y].element;

???????????? element.push_back ( items[ii] );

???????????? has[ii] = 1;

???????????? x++;

??????????? if ( x != str.length()-1 )

??????????? {

??????????????? queue<string> q;

??????????????? q.push( str.substr(x+1,1) );

??????????????? while ( !q.empty() )

??????????????? {

??????????????????? string u= q.front();

??????????????????? q.pop();

??????????????????? vector<int>& id = dic[u];

??????????????????? for( int j = 0 ; j < id.size() ; j++ )

??????????????????? {

??????????????????????? int tx = id[j];

??????????????????????? if ( items[tx].right[0] == CH )

??????????????????????? {??

??????????????????????????? if ( has[tx] ) continue;

??????????????????????????? has[tx] = 1;

??????????????????????????? if ( isupper(items[tx].right[1] ) )

??????????????????????????????? q.push ( items[tx].right.substr(1,1));

??????????????????????????? element.push_back ( items[tx] );

??????????????????????? }???

??????????????????? }

??????????????? }

??????????? }

??????? }

??????? map<int,Closure>::iterator

it = temp.begin();

??????? for ( ; it != temp.end() ; it++ )

??????????????? collection.push_back ( it->second );

??????? for ( int i = 0 ; i < collection.size() ; i++ )

??????????? sort( collection[i].element.begin() , collection[i].element.end() );

??????? for ( int i = 0 ; i < collection.size() ; i++ )

??????????? for ( int j = i+1 ; j < collection.size() ; j++ )

??????????????? if ( collection[i] == collection[j] )

??????????????????? collection.erase ( collection.begin()+j );

??? }

//closure

??? puts("-------------CLOSURE---------------------");

??? stringstream sin;

??? for ( int i = 0 ; i < collection.size() ; i++ )

??? {

??????? sin.clear();

??????? string out;

??????? sin<<"closure-I(" << i<<")";

??????? sin>> out;

??????? collection[i].print ( out );

??? }

??? puts("");


}


void make_V ( )

{

??? memset( used , 0 , sizeof ( used ) );

??? for ( int i = 0 ; i < wf.size() ; i++ )

??? {

??????? string& str = wf[i].left;

??????? for ( int j = 0 ; j < str.length() ; j++ )

??????? {

??????????? if ( used[str[j]] ) continue;

??????????? used[str[j]] = 1;

??????????? V.push_back ( str[j] );

??????? }

??????? string& str1 = wf[i].right;

??????? for ( int j = 0 ; j < str1.length() ; j++ )

??????? {

??????????? if ( used[str1[j]] ) continue;

??????????? used[str1[j]] = 1;

??????????? V.push_back ( str1[j] );

??????? }

??? }

??? sort( V.begin() , V.end() );

??? V.push_back ( '#' );

}


void make_cmp ( vector<WF>& cmp1 , inti? , char ch )

{

??? for ( int j = 0 ; j < collection[i].element.size() ; j++ )

??? {

??????? string str= collection[i].element[j].right;

??????? int k;

??????? for ( k = 0 ; k < str.length() ; k++ )

??????????? if ( str[k] == CH )

??????????????? break;

??????? if ( k != str.length() - 1 && str[k+1] ==ch? )

??????? {

??????????? str.erase ( str.begin()+k);

??????????? str.insert ( str.begin()+k+1 , CH );

??????????? cmp1.push_back ( WF ( collection[i].element[j].left , str , -1 , -1 ) );

??????? }

??? }

??? sort( cmp1.begin() , cmp1.end() );

}


void make_go ( )

{

??? memset( go , -1 , sizeof ( go ) );

??? int m = collection.size();

??? for ( int t = 0 ; t < V.size() ; t++ )

??? {

??????? char ch = V[t];

??????? for ( int i = 0 ; i < m ; i++ )

??????? {

??????????? vector<WF> cmp1;

??????????? make_cmp( cmp1 , i , ch );

??????????? if ( cmp1.size() == 0 ) continue;

??????????? for ( int j = 0 ; j < m ; j++ )

??????????? {

??????????????? vector<WF> cmp2;

??????????????? for ( int k = 0 ; k < collection[j].element.size() ; k++ )

??????????????? {

??????????????????? string& str = collection[j].element[k].right;

??????????????????? int x;

??????????????????? for ( x = 0 ; x < str.length() ; x++ )

??????????????????????? if ( str[x] == CH )

??????????????????????????? break;

??????????????????? if ( x && str[x-1] == ch )

?????????????????????? cmp2.push_back ( WF( collection[j].element[k].left , str , -1 , -1 ) );

??????????????? }

??????????????? sort( cmp2.begin() , cmp2.end() );

??????????????? bool flag = true;

??????????????? if ( flag )

??????????????????? go[i][ch] = j;

??????????? }

??????? }


??? }




}



void make_table ( )

{

??? memset( Goto , -1 , sizeof ( Goto ) );

??? for( int i = 0 ; i < collection.size() ; i++ )

??????? for ( int j = 0 ; j < V.size() ; j++ )

??????? {

??????????? char ch = V[j];

??????????? int x = go[i][ch];

??????????? if ( x == -1 ) continue;

??????????? if ( !isupper(ch) )

??????????????? action[i][ch] = Content ( 0 , x );

??????????? else

??????????????? Goto[i][ch] = x;

??????? }

??? for ( int i = 0 ; i < collection.size() ; i++ )

??????? for ( int j = 0 ; j < collection[i].element.size() ; j++ )

??????? {

??????????? WF& tt = collection[i].element[j];

??????????? if ( tt.right[tt.right.length()-1] == CH )

??????????? {

??????????????? if ( tt.left[0] == 'S' )

??????????????????? action[i]['#'] = Content ( 2 , -1 );

??????????????? else

??????????????????? for ( int k = 0 ; k < V.size() ; k++ )

??????????????????? {

??????????????????????? int y = V[k];

??????????????????????? action[i][y] = Content ( 1, tt.back );

??????????????????? }

??????????? }

??????? }

#ifdef DEBUG

??? puts( "-----------------------LR(0)分析表-------------------------------" );

??? printf( "%10s%5c%5s" , "|" , V[0]? , "|");

??? for ( int i = 1 ; i < V.size() ; i++ )

??????? printf( "%5c%5s" , V[i] , "|" );

??? puts("");

??? for ( int i = 0 ; i < (V.size()+1)*10 ; i++ )

??????? printf( "-" );

??? puts("");

??? stringstream sin;

??? for ( int i = 0 ; i < collection.size() ; i++ )

??? {

??????? printf( "%5d%5s" , i , "|" );

??????? for ( int j = 0 ; j < V.size() ; j++ )

??????? {

??????????? char ch = V[j];

??????????? if ( isupper(ch) )

??????????? {

??????????????? if ( Goto[i][ch] == -1 )

??????????????????? printf( "%10s" , "|" );

??????????????? else

??????????????????? printf( "%5d%5s" , Goto[i][ch] , "|" );

??????????? }

??????????? else

??????????? {

??????????????? sin.clear();

??????????????? if ( action[i][ch].type == -1 )

??????????????????? printf( "%10s" , "|" );

??????????????? else

??????????????? {

??????????????????? Content& temp = action[i][ch];

??????????????????? if ( temp.type == 0 )

??????????????????????? sin<< "S";

??????????????????? if ( temp.type == 1 )

??????????????????????? sin<< "R";

??????????????????? if ( temp.type == 2 )

??????????????????????? sin<< "acc";

??????????????????? if ( temp.num != -1 )

??????????????????????? sin<< temp.num;

??????????????????? sin>> temp.out;

??????????????????? printf( "%7s%3s" , temp.out.c_str() , "|" );

??????????????? }

??????????? }

??????? }

??????? puts("");

??? }

??? for ( int i = 0 ; i < (V.size()+1)*10 ; i++ )

??????? printf( "-" );

??? puts("");

#endif

}


void print ( string s1 , string s2 , string s3 , string s4 , string s5 , string s6 , string s7 )

{

??? printf( "%-15s|%-15s%-15s%-20s|%-15s%-15s%-15s\n" , s1.c_str() , s2.c_str() , s3.c_str() ,s4.c_str(),s5.c_str(),

???????????????????????????????????????????????????????s6.c_str() , s7.c_str() );???????????????????????????

}


string get_steps ( int x )

{

??? stringstream sin;

??? sin<< x;

??? string ret;

??? sin>> ret;

??? return ret;

}


template<class T>

string get_stk ( vector<T> stk )

{

??? stringstream sin;

??? for ( int i = 0 ; i < stk.size() ; i++ )

??????? sin<< stk[i];

??? string ret;

??? sin>> ret;

??? return ret;

}


string get_shift ( WF& temp )

{

??? stringstream sin;

??? sin<< "reduce(" << temp.left << "->" << temp.right <<")";

??? string out;

??? sin>> out;

??? return out;

}


int main ( )

{

??? int n;

??? char s[MAX];

??? printf("輸入以S為開始符的文法捂敌，請(qǐng)輸入文法個(gè)數(shù)：");

??? while ( ~scanf ( "%d" , &n ) )

??? {??? printf("請(qǐng)輸入文法:\n");

??????? for ( int i = 0 ; i < n ; i++ )

??????? {

??????????? scanf( "%s" , s );

??????????? int len = strlen(s),j;

??????????? for ( j = 0 ; j < len ; j++ )

??????????????? if ( s[j] == '-' ) break;

??????????? s[j] = 0;

??????????? wf.push_back ( WF ( s , s+j+2 ,-1 , -1 ) );

??????? }

??????? make_item();

??????? make_set();

??????? make_V();

??????? make_go();

??????? make_table();

??? }

}

?著作權(quán)歸作者所有,轉(zhuǎn)載或內(nèi)容合作請(qǐng)聯(lián)系作者
  • 人面猴
    序言：七十年代末，一起剝皮案震驚了整個(gè)濱河市既琴，隨后出現(xiàn)的幾起案子占婉，更是在濱河造成了極大的恐慌，老刑警劉巖甫恩，帶你破解...
    沈念sama閱讀 217,509評(píng)論 6贊 504
  • 死咒
    序言：濱河連續(xù)發(fā)生了三起死亡事件逆济，死亡現(xiàn)場(chǎng)離奇詭異，居然都是意外死亡磺箕，警方通過(guò)查閱死者的電腦和手機(jī)奖慌，發(fā)現(xiàn)死者居然都...
    沈念sama閱讀 92,806評(píng)論 3贊 394
  • 救了他兩次的神仙讓他今天三更去死
    文/潘曉璐 我一進(jìn)店門，熙熙樓的掌柜王于貴愁眉苦臉地迎上來(lái)松靡，“玉大人简僧，你說(shuō)我怎么就攤上這事〉衿郏” “怎么了岛马？”我有些...
    開封第一講書人閱讀 163,875評(píng)論 0贊 354
  • 道士緝兇錄：失蹤的賣姜人
    文/不壞的土叔 我叫張陵，是天一觀的道長(zhǎng)屠列。 經(jīng)常有香客問(wèn)我啦逆，道長(zhǎng)，這世上最難降的妖魔是什么脸哀？ 我笑而不...
    開封第一講書人閱讀 58,441評(píng)論 1贊 293
  • ?港島之戀（遺憾婚禮）
    正文 為了忘掉前任蹦浦，我火速辦了婚禮，結(jié)果婚禮上撞蜂，老公的妹妹穿的比我還像新娘盲镶。我一直安慰自己，他們只是感情好蝌诡，可當(dāng)我...
    茶點(diǎn)故事閱讀 67,488評(píng)論 6贊 392
  • 惡毒庶女頂嫁案：這布局不是一般人想出來(lái)的
    文/花漫 我一把揭開白布溉贿。 她就那樣靜靜地躺著，像睡著了一般浦旱。 火紅的嫁衣襯著肌膚如雪宇色。 梳的紋絲不亂的頭發(fā)上，一...
    開封第一講書人閱讀 51,365評(píng)論 1贊 302
  • 城市分裂傳說(shuō)
    那天颁湖，我揣著相機(jī)與錄音宣蠕，去河邊找鬼。 笑死甥捺，一個(gè)胖子當(dāng)著我的面吹牛抢蚀，可吹牛的內(nèi)容都是我干的。 我是一名探鬼主播镰禾，決...
    沈念sama閱讀 40,190評(píng)論 3贊 418
  • 雙鴛鴦連環(huán)套：你想象不到人心有多黑
    文/蒼蘭香墨 我猛地睜開眼皿曲，長(zhǎng)吁一口氣：“原來(lái)是場(chǎng)噩夢(mèng)啊……” “哼唱逢！你這毒婦竟也來(lái)了？” 一聲冷哼從身側(cè)響起屋休，我...
    開封第一講書人閱讀 39,062評(píng)論 0贊 276
  • 萬(wàn)榮殺人案實(shí)錄
    序言：老撾萬(wàn)榮一對(duì)情侶失蹤坞古，失蹤者是張志新（化名）和其女友劉穎，沒(méi)想到半個(gè)月后劫樟，有當(dāng)?shù)厝嗽跇淞掷锇l(fā)現(xiàn)了一具尸體痪枫，經(jīng)...
    沈念sama閱讀 45,500評(píng)論 1贊 314
  • ?護(hù)林員之死
    正文 獨(dú)居荒郊野嶺守林人離奇死亡，尸身上長(zhǎng)有42處帶血的膿包…… 初始之章·張勛 以下內(nèi)容為張勛視角 年9月15日...
    茶點(diǎn)故事閱讀 37,706評(píng)論 3贊 335
  • ?白月光啟示錄
    正文 我和宋清朗相戀三年叠艳，在試婚紗的時(shí)候發(fā)現(xiàn)自己被綠了听怕。 大學(xué)時(shí)的朋友給我發(fā)了我未婚夫和他白月光在一起吃飯的照片。...
    茶點(diǎn)故事閱讀 39,834評(píng)論 1贊 347
  • 活死人
    序言：一個(gè)原本活蹦亂跳的男人離奇死亡虑绵，死狀恐怖尿瞭，靈堂內(nèi)的尸體忽然破棺而出，到底是詐尸還是另有隱情翅睛，我是刑警寧澤声搁，帶...
    沈念sama閱讀 35,559評(píng)論 5贊 345
  • ?日本核電站爆炸內(nèi)幕
    正文 年R本政府宣布，位于F島的核電站捕发，受9級(jí)特大地震影響疏旨，放射性物質(zhì)發(fā)生泄漏。R本人自食惡果不足惜扎酷，卻給世界環(huán)境...
    茶點(diǎn)故事閱讀 41,167評(píng)論 3贊 328
  • 男人毒藥：我在死后第九天來(lái)索命
    文/蒙蒙 一檐涝、第九天 我趴在偏房一處隱蔽的房頂上張望。 院中可真熱鬧法挨，春花似錦谁榜、人聲如沸。這莊子的主人今日做“春日...
    開封第一講書人閱讀 31,779評(píng)論 0贊 22
  • 一樁弒父案窃植，背后竟有這般陰謀
    文/蒼蘭香墨 我抬頭看了看天上的太陽(yáng)。三九已至荐糜，卻和暖如春巷怜，著一層夾襖步出監(jiān)牢的瞬間，已是汗流浹背暴氏。 一陣腳步聲響...
    開封第一講書人閱讀 32,912評(píng)論 1贊 269
  • 情欲美人皮
    我被黑心中介騙來(lái)泰國(guó)打工延塑， 沒(méi)想到剛下飛機(jī)就差點(diǎn)兒被人妖公主榨干…… 1. 我叫王不留，地道東北人答渔。 一個(gè)月前我還...
    沈念sama閱讀 47,958評(píng)論 2贊 370
  • 代替公主和親
    正文 我出身青樓关带，卻偏偏與公主長(zhǎng)得像，于是被迫代替她去往敵國(guó)和親研儒。 傳聞我的和親對(duì)象是個(gè)殘疾皇子豫缨，可洞房花燭夜當(dāng)晚...
    茶點(diǎn)故事閱讀 44,779評(píng)論 2贊 354

推薦閱讀更多精彩內(nèi)容