We present a tableau-based algorithm for obtaining a B?uchi automaton from a formula in Dynamic Linear Time Temporal Logic (DLTL), a logic which extends LTL by indexing the until operator with regular programs. The construction of the states of the automaton is similar to the standard construction for LTL, but a different technique must be used to verify the fulfillment of until formulas. The resulting automaton is a B?uchi automaton rather than a generalized one. The construction can be done on-the-fly, while checking for the emptiness of the automaton.