食品伙伴網(wǎng)服務(wù)號
 
 
當(dāng)前位置: 首頁 » 專業(yè)英語 » 英語短文 » 正文

一生之愛

放大字體  縮小字體 發(fā)布日期:2008-06-26
核心提示:Once upon a time a teacher and his student lay down under the big tree near the big grass area. Then suddenly the student asked the teacher. Teacher, I'm confused, how do we find our soul mate? Can you please help me? Silent for a few seconds, the t


Once upon a time a teacher and his student lay down under the big tree near the big grass area. Then suddenly the student asked the teacher.

"Teacher, I'm confused, how do we find our soul mate? Can you please help me?"

Silent for a few seconds, the teacher then answered, "Well, it's a pretty hard and an easy question."

The teacher continued, "Look that way, there is a lot of grass, why don't you walk there? Please don't walk backwards, just walk straight ahead. On your way, try to find a blade of beautiful grass and pick it up and then give it to me. But just one."

The student said, "Well, OK then... wait for me..." and walked straight ahead to the grassy field.

A few minutes later the student came back.

The teacher asked, "Well, I don't see a beautiful blade of grass in your hand."

The student said, "On my journey, I found quite a few beautiful blade of grass, but I thought that I would find a better one, so I didn't pick it. But I didn't realize that I was at the end of the field, and I hadn't picked any because you told me not to go back, so I didn't go back."

The teacher said, "That's what will happen in real life."

What is the message of this story?

In the story, grass is the people around you, the beautiful blade of grass is the people that attract you and the grassy field is time.

In looking for your soul mate, please don't always compare and hope that there will be a better one. By doing that, you'll waste your lifetime, cause remember "Time Never Goes Back".

更多翻譯詳細(xì)信息請點(diǎn)擊:http://www.trans1.cn
 
關(guān)鍵詞: 一生之愛
[ 網(wǎng)刊訂閱 ]  [ 專業(yè)英語搜索 ]  [ ]  [ 告訴好友 ]  [ 打印本文 ]  [ 關(guān)閉窗口 ] [ 返回頂部 ]
分享:

 

 
推薦圖文
推薦專業(yè)英語
點(diǎn)擊排行
 
 
Processed in 2.122 second(s), 364 queries, Memory 1.92 M