I think the following works. More generally, I think it shows (with a little extra work) that an embedding of $(0,1)$ can only split the plane into two components if the end points are at infinity (i.e. it extends to an embedding of $S^1$ in $S^2$ containing $\infty$).
Theorem. There is no embedding of $[0,1)$ in $\mathbb{R}^2$ that separates the plane into two (or more) connected components.
Let $\gamma:[0,1)\rightarrow \mathbb{R}^2$ be an embedding, and let $C$ be its image. We say that $C$ locally splits the plane into $n$ components at $c\in C$ if every neighbordhood of $c$ contains neighborhood $N$ of $c$ homeomorphic to $\mathbb{R}^2$ such that $N-C$ has $n$ components. The idea is that for each $t$, $C$ locally splits the plane into either $1$ or $2$ components near $\gamma(t)$, depending on whether $t=0$ or $t>0$. Connectivity of $C$ allows us to stitch up these neighborhoods, which shows that all local components of $\mathbb{R}^2-C$ near $C$ are part of the same global component $\Gamma$.
But the global components of $\mathbb{R}^2-C$ containing $\gamma(t)$ as a limit point are precisely those that show up (as a subset) as a local component near $\gamma(t)$. Thus, $C\subset\overline{\Gamma}$ and and $C$ is disjoint from the closures of all other components of $\mathbb{R}^2-C$. In fact, $C\subset\overline{\Gamma}$ implies $\overline{C}\subset\overline{\Gamma}$, so $\overline{C}-C\subset\Gamma$. However, each component of $\mathbb{R}^2-C$ must have boundary contained in $\overline{C}$, so it is not possible for there to be another component.
Moise Ch10 Theorem 13. Every triangulable set in $\mathbb{R}^2$ is tame.
Triangulable means homeomorphic to a Euclidean simplicial complex, and tame means ambiently so.
For us, this means there is an ambient homoemorphism of $\mathbb{R}^2$ sending $C$ to an infinite polygonal chain $P$ with exactly one endpoint. Since $C$ is an embedding, so is $P$, so WLOG, we can assume $\gamma$ is piece-wise linear.
Lemma 1. $C$ locally splits the plane into $1$ or $2$ components near $\gamma(t)$, depending on whether $t=0$ or $t>0$, respectively.
By Moise, we can assume $C$ is a linear complex. Let $t\in [0,1)$, and let $K$ be the union of the edges containing $\gamma(t)$. Define $\varepsilon_t$ to be the minimum distance from $\gamma(t)$ to a vertex in $K-\{\gamma(t)\}$. Then, for $\varepsilon\leq\varepsilon_t$, $N_\varepsilon\cap K$ is connected and the image of an open interval $I$ (w.r.t the topology of $[0,1)$) under $\gamma$. If there are arbitrarily small $\varepsilon\leq\varepsilon_t$ for which $N_\varepsilon\cap C$ is disconnected, then there is a sequence $(t_n)$ with $t_n\not\in \gamma^{-1}(K)\supset I$ such that $\lim_{n\rightarrow\infty}\gamma(t_n)=\gamma(t)$, which contradicts the fact that $\gamma$ is an embedding. Thus, $N_\varepsilon\cap C$ is connected for $\varepsilon$ sufficiently small.
Now within $N_\varepsilon$, $K$ is simply the union of two radii when $t>0$, and one radius when $t=0$. Thus, $N_\varepsilon-C=N_\varepsilon-K$ has one or two components, depending on whether $t=0$ or $t>0$, respectively. $\square$
Lemma 2. There is a single connected component $\Gamma\subseteq\mathbb{R}^2-C$ such that every sufficiently small neighborhood of $c\in C$ has intersection with $\mathbb{R}^2-C$ contained in $\Gamma$.
A choice function $f$ taking $t$ to a $N_\varepsilon$ as in lemma 1 for each $t$ results in a covering of $C$ by $\{f(t)\}_{t\in[0,1)}$ and a covering for $[0,1)$ by $\{\gamma^{-1}(f(t))\}_{t\in[0,1)}$. Each point of $f(t)\cap C$ is a limit point of each of the components of $f(t)-C$. Thus, each component of $f(t)-C$ must intersect a component of $f(t')-C$ for $t'\in \gamma^{-1}(f(t))$. So on any interval $I$ (i.e. a connected set), the number of connected components of $\bigcup_{t\in I}f(t)-C$ cannot exceed the number of connected components of $f(t)-C$ for any $t\in I$. In particular, $\bigcup_{t\in[0,1)}f(t)-C$ is connected. $\square$
Edit. I realized, as pointed out in the comments, that I had assumed every $c\in C$ necessarily had an $\varepsilon$-neighborhood with connected intersection with $C$. This does not seem to be trivial, or necessarily true. I have remedied this with Moise's theorem on the tameness of triangulable manifold embeddings in $\mathbb{R}^2$, which made using Hatcher 2B.1 unnecessary.