This questing was something related to parse trees.

Input: A full sentence: (S (NP (NNP James)) (VP (VBZ is) (NP (NP (DT a) (NN boy)) (VP (VBG eating) (NP (NNS sausages))))))

Output: James is a boy eating sausages

Input: (NNS Sausages)

Output: Sausages

Input: (NP(DT a) (NN boy))

Output: a boy

[advanced_iframe securitykey=”undefined” src=”https://code.kodnest.com/” width=”100%” height=”600″]