Index: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Home > Reg Shoe

Reginald Shoe (usually Reg Shoe) is a character from Terry Pratchett's Discworld series. Reg is a Constable in the Ankh-Morpork City Night Watch. He died in the Ankh-Morpork Revolution (possibly one of the later ones; little to no information is given on any previous ones, let alone their existence), from several crossbow bolts, among other things. He is one of the ones who became a zombie when he died, looked Death in the eye, and said, "Screw you." (metaphorically speaking)

This article is a stub. You can help Wikipedia by [ ṣlocalurl: : |action=edit}} expanding it].

Discworld characters

Read more »

<Hide>

Topics: Reg Shoe, Regional Rail, Regina, Reggae, Regular Expression...

Regional railConnex commuter train stands by the platform in Melbourne, Australia Regional rail systems, or commuter rail systems, usually provide a rail service through a central business district area into suburbs or other locations that draw large numbers of people	ReginaRegina may refer to: Latin word for Queen Regina, Saskatchewan, the capital of the Canadian province of Saskatchewan. Regina, New Mexico the Roman goddess Juno; see Hera Saint Regina Rexx, open-source REXX interpreter for Linux, BSD, Windows, etc. Popular	ReggaeReggae is an African Caribbean style of music developed on the island of Jamaica and is closely linked to the religion Rastafarianism, though not universally popular among its members. The origins of reggae can be found in traditional African Caribbean mu
Regular expressionA regular expression (abbreviated as regexp regex or by some regxp is a string that describes a whole set of strings, according to certain syntax rules. These expressions are used by many text editors and utilities (especially in the Unix operating system	RegexRegex is an abbreviation of regular expression. Regex is a C regular expression library written by Henry Spencer. Later versions support the POSIX standardized regular expressions. Regex is now found in various places: :Bundled with application such as Ap	Regular languageA regular language is a formal language (i. a possibly infinite set of finite sequences of symbols from a finite alphabet) that satisfies the following equivalent properties: it can be accepted by a deterministic finite state machine it can be accepted by
Regular grammar	Regiomontanus	Regular semantics
Register	Regency dance	Register Transfer Language
Regression	Regress argument	Regulation of Investigatory Powers Act 2000

Non User