165162
Example LMGs can characterize the non-CF language \ as follows : The derivation for aabbcc , using parentheses also for grouping , is thereforeS ( ) \ to x \ text A ( ) \ B ( x ) \ to x \ text ( a \ A ( ) ) \ B ( x ) \ to x \ text ( aa \ A ( ) ) \ B ( x ) \ to x \ text aa \ B ( x ) \ to aa \ B ( aa ) Computational Power Languages generated by LMGs contain the context-free languages as a proper subset , as every CFG is an LMG where all predicates have arity 0 and no production rule contains variable bindings or slash deletions .
 None
Given options, please tell me the categories of all the listed entity words.Output format is "type1: word1; type2: word2". 
Option: location, person, organization 
Text: {0} 
 Entities:  
Answer:
 None