早教吧作业答案频道 -->英语-->
一个在NYTIMES新闻句子看来的语法问题,求大侠们指教WASHINGTON—Lostamidtheelection-yearwranglingoverthemilitants’attackontheUnitedStatesMissioninBenghazi,Libya,isacomplexbackstoryinvolvinggrowingregionalre
题目详情
一个在NYTIMES新闻句子看来的语法问题,求大侠们指教
WASHINGTON — Lost amid the election-year wrangling over the militants’ attack on the United States Mission in Benghazi,Libya,is a complex back story involving growing regional resentment against heavily armed American private security contractors,increased demands on State Department resources and mounting frustration among diplomats over ever-tighter protections that they say make it more difficult to do their jobs.当中是不是倒装了,可以恢复正常语序并解释一下吗;如果不是可以解释一下吗,从语法角度上?
WASHINGTON — Lost amid the election-year wrangling over the militants’ attack on the United States Mission in Benghazi,Libya,is a complex back story involving growing regional resentment against heavily armed American private security contractors,increased demands on State Department resources and mounting frustration among diplomats over ever-tighter protections that they say make it more difficult to do their jobs.当中是不是倒装了,可以恢复正常语序并解释一下吗;如果不是可以解释一下吗,从语法角度上?
▼优质解答
答案和解析
核心句子换成正常语序是这样的:a complex back story is lost amid ...【直译:一个复杂的故事迷失于…….意译:在……中,一个复杂的故事被世人忽视了.】
如果你还能理解以下关键结构,这句话就明白了:
wrangling over the attack on the mission in Libya
a story involving resentment agaist contractors,demands,and frustration.
protection that make it more difficult to do their jobs.(这里的they say是插入语,可以省略不看)
如果你还能理解以下关键结构,这句话就明白了:
wrangling over the attack on the mission in Libya
a story involving resentment agaist contractors,demands,and frustration.
protection that make it more difficult to do their jobs.(这里的they say是插入语,可以省略不看)
看了 一个在NYTIMES新闻句子...的网友还看了以下:
谁帮我做下下面的关于时间复杂度的习题?f(n)=100n^3+n^2+1000,g(n)=25n^ 2020-06-12 …
选出下列词语中注音有误的一项:()A.差chà劲付讫qì百折不挠náo逆nì来顺受B.驾驭yù钻营 2020-06-28 …
A.炽痛(chì)嗥鸣(háo)斑斓(lán)B.谰语(lán)怪诞(dàn)亘古(gèng)C. 2020-07-05 …
下列加粗词语读音全都下列加粗词语读音全都正确的一项是[]A.炽痛(chì)嗥鸣(háo)斑斓(lá 2020-07-05 …
若某共价化合物分子中只含有C、H、O、N四种元素,且以n(C)、n(N)、n(O)分别表示C、N、 2020-07-20 …
求给以下算法复杂度排序增长速度由慢到快1)O(n^(3/4))O(log(n)^5)O(2^n)O 2020-07-23 …
一个有关大O(阶)的问题求两个单调递增函数f(n)和g(n)(n为自然数),f(n)≠O(g(n) 2020-07-31 …
设f(N)、g(N)是定义在正数集上的正函数.如果存在正的常数C和自然数N0,使得当N≥N0时有f 2020-07-31 …
数据结构的问题6.程序段For(i=n-1;i>0;i--)For(j=1;ja[j+1])a[j] 2020-10-30 …
程序段for(i=n-1;i>=0;i--)for(j=1;jA[j+1]A[j]与A[j+1]对换 2020-11-26 …