Using representations of posets and lattices by levels of fuzzy sets, we obtain a completion of posets to complete lattices. It turns out that this completion is equivalent with the famous Dedekind-MacNeille completion, but the algorithm presented here is much simpler.