KSM
Parse-tree- using Stanford Parser
(ROOT
(S
(PP (IN For)
(NP (DT every) (JJ positive) (NN number) (NN
epsilon)))
(, ,)
(NP (EX there))
(VP (VBZ is)
(NP (DT a) (JJ positive) (NN number) (NN delta))
(PP (JJ such))
(SBAR (IN that)
(S
(SBAR (IN if)
(S
(NP (DT the) (NN
distance_from_x_to_a))
(VP
(VP (VBZ is)
(ADJP
(JJR less))
(PP (IN
than)
(NP (NN delta))))
(CC and)
(VP (VBZ is)
(ADJP
(JJR greater))
(PP (IN
than)
(NP (NN zerp)))))))
(, ,)
(NP
(NP (RB then) (DT the) (NN
distance))
(PP (IN from)
(NP
(NP (SYM f))
(PP (IN of)
(NP
(NP (SYM x))
(PP (TO to)
(NP (NN L))))))))
(VP (VBZ is)
(ADJP
(ADJP (JJR less))
(PP (IN than)
(NP (NN
epsilon))))))))))