In ongoing work, we develop a code generator for Reo connectors. Our current tool works by computing the formal semantics of a connector as a constraint automaton (CA) and then translating that CA to Java code. This approach requires us to deal with data constraints (i.e., transition labels of CA), which raises several interesting issues, from expressiveness to performance. The main aim of this talk is to give the audience some insight into what these issues are, how we (plan to) solve them, and what problems are still open. We also give a concise introduction to Reo/CA and sketch the general context in which our work takes place; the talk should be understandable also to people less familiar with Reo.