The present work is a study of the deterministic generation of combinatorial structures. We generate classes of combinatorial structures formally specifiable by grammars involving unlabelled sequence, unlabelled set, unlabelled multiset, unlabelled pointing, unlabelled unpointing, unlabelled substitution, labelled sequence, labelled set, labelled multiset, labelled cycle, labelled pointing, labelled unpointing and labelled substitution constructions. It consists of some basic preliminaries about classes of combinatorial structures and three chapters. The first one, Unlabelled Unranking , solves the unranking of unlabelled structures. The second one, Labelled Unranking, solves the unranking of labelled structures. The third one, Product of labellings, explains the order of the labellings in the structures. Appendix contains the libraries developed in this work.