The cd-index of an Eulerian poset is a polynomial in noncommuting variables that is used to encode data on the number of chains within that poset.  I will focus in this talk on a particular class of Eulerian posets involving the Bruhat order of Coxeter groups.  I will use poset operations such as zipping and the pyramid operation to develop Reading's recursive formula for the cd-index of Bruhat intervals.