Final exam question for algebraic structures:

(1) Prove that for a given semantic meaning Γ there exist countably infinite JSON-LD objects ρ with the same semantic meaning resulting from compaction w/ different contexts

(2) Prove, given the result in (1), that for AS2 based on JSON-LD there are uncountably infinite valid AS2 representations of the same semantic data

(3) Given the result in (2), what time and space complexity would apply to a generalized parser? Why do you think that?