[Right triangle ⏵ may be expanded, down triangle ⏷ to close. Button = tree pop-up. × = close pop-up.]

Terminal: run. Derivation Graphs: (left-to-right) compact / full; (top-down) full / compact.

Help: blue = parse inside. Abbr.: WS: Workspace; Initial WS: initial heads for Merge after LEX lookup.

WS n, n = 1,2,... for intermediate stages after Initial WS. Final WS: when WS items converge on a single SO.
Bracketing: {...} (Merge). {...} (FormSet). At Spellout, {...} indicates free word order. [word] indicates word is optionally present.
Head Hd_{selection/features}, e.g. p_θ = predicate head p that seeks a θ-relevant (θR) IA from the WS. p_θ is a θ-seeker (θS).
v_see:θ:pst = head v has complement see, a θR EA from the WS and TNS. v is also a θS.
INFL seeks θR from its complement (not the WS).
Complementizer C comes in different flavors wrt. Force, .e.g. declarative C, interrogative C_Q and relative clause head C_rel.
Features, e.g. TNS pres/pst or DET the/a (shorthand for a bundle of semantic features).
Note: φ-features, e.g. 1sg, appear only at Spellout. Some words do not project, turn into features, e.g. determiners.

Words: a train has arrived

Initial WS 1: arrive_θ:_pastp v_arrive v_v:_perf:_pres INFL_v:_3sg train_a

WS 1: {arrive_θ:_pastp, train_a} v_arrive v_v:_perf:_pres INFL_v:_3sg

WS 2: {v_arrive, {arrive_θ:_pastp, train_a}} v_v:_perf:_pres INFL_v:_3sg

WS 3: {v_v:_perf:_pres, {v_arrive, {arrive_θ:_pastp, train_a}}} INFL_v:_3sg

WS 4: {INFL_v:_3sg, {v_v:_perf:_pres, {v_arrive, {arrive_θ:_pastp, train_a}}}}

Final WS: {C, {INFL_v:_3sg, {v_v:_perf:_pres, {v_arrive, {arrive_θ:_pastp, train_a}}}}}

INT/EXT: {C, {INFL_v:_3sg, {v_v:_perf:_pres, {v_arrive, {arrive_θ:_pastp, train_a}}}}}

EXT: a train 3sg pres have en arrive

Spellout: a train has arrived

Parse found: a train 3sg pres have en arrive

EXT: there 3sg pres have en arrive a train

Spellout: there has arrived a train

Blocked: inconsistent with input!

Final WS: {C_Q:_{aux(3sg,pres,have)}, {INFL_v:_3sg, {v_v:_perf:_pres, {v_arrive, {arrive_θ:_pastp, train_a}}}}}

INT/EXT: {C_Q:_{aux(3sg,pres,have)}, {INFL_v:_3sg, {v_v:_perf:_pres, {v_arrive, {arrive_θ:_pastp, train_a}}}}}

EXT: 3sg pres have →→ a train 3sg pres have en arrive

Spellout: 3sg pres have a train en arrive

Spellout: has a train arrived

Blocked: inconsistent with input!

EXT: 3sg pres have →→ there 3sg pres have en arrive a train

Spellout: 3sg pres have there en arrive a train

Spellout: has there arrived a train

Blocked: inconsistent with input!