What are the steps/tricks/tips to construct a Büchi automaton from a given language?
You can construct an NBA for an $\omega$-regular expression $r$ by induction on the generating sequence of $r$, using the constructive closure properties of NBAs.

You can see some examples here