277
For LR -LRB- 0 -RRB- grammars , our algorithm is closely related to the recursive ascent parsers recently discovered by Kruse-man Aretz -LSB- 1 -RSB- and Roberts -LSB- 2 -RSB- .
 used for: algorithm, LR -LRB- 0 -RRB- grammars; conjunction: algorithm, recursive ascent parsers
Given a phrase that describes the relationship between two words, extract the words and the lexical relationship between them. The output format should be "relation1: word1, word2; relation2: word3, word4". 
Option: conjunction, feature of, hyponym of, used for, part of, compare, evaluate for 
Text: {0} 
Answer:
 used for: algorithm, LR -LRB- 0 -RRB- grammars; conjunction: algorithm, recursive ascent parsers