South Dakota Highway 53

South Dakota Highway 53 (SD 53) is a state route that runs north to south across south central South Dakota. It consists of two separate segments:

Highway 53
Route of SD 53 (in red)
Route information
Defined by SDCL §31-4-172
Maintained by SDDOT
Length67.475 mi[1] (108.590 km)
Existed1926–present
Southern segment
Length34.372 mi (55.316 km)
South endNebraska state line
North end US 18 west of Winner
Northern segment
Length33.103 mi (53.274 km)
South end SD 44 east of Wood
North end I-90 / US 83 in Vivian
Location
CountiesLyman, Mellette, Tripp
Highway system
  • South Dakota Highways
SD 52SD 54

History

South Dakota 53 in 1926 ran from the North Dakota to Nebraska borders. By 1929, when U.S. Highway 83 was first designated, it replaced the segment of SD 53 from Pierre to the North Dakota border. The southern segment was further east than the present route, running from Presho south to the Nebraska border via Winner.

In the early 1930s, U.S. 83 was extended south into Nebraska, and was placed as dual signage along SD 53. (The original route was on what is now U.S. Highway 183; 83 and 183 were reversed from current alignments when first designated.) By 1935, SD 53 was removed from this alignment and placed on a new route extending south from Vivian, on a previously unnumbered road. The southern terminus was at South Dakota Highway 40 (now 44). Also at this time, the northern terminus was pulled back to Vivian.

In the late 1960s, a second segment of SD 53 was added further south, beginning at U.S. Highway 18 just west of the U.S. 183 junction, and extending south to Clearfield.

In 1996, the southern terminus of SD 53 was extended to the Nebraska border.

Major intersections

CountyLocationmi[1]kmDestinationsNotes
Tripp0.0000.000End state maintenance at the Nebraska state line
Clearfield18.40029.612Signed south end of SD 53
34.37255.316 US 18
Gap in route
Mellette34.37255.316 SD 44
LymanVivian67.475108.590 I-90 / US 83
1.000 mi = 1.609 km; 1.000 km = 0.621 mi
gollark: Features Minimal setup - one binary and you are good to go! First class closures Garbage collection First class green threads (continuations) Python style generators (implemented as a plain macro) Mutable and immutable arrays (array/tuple) Mutable and immutable hashtables (table/struct) Mutable and immutable strings (buffer/string) Macros Byte code interpreter with an assembly interface, as well as bytecode verification Tail call optimization Direct interop with C via abstract types and C functions Dynamically load C libraries Functional and imperative standard library Lexical scoping Imperative and functional programming REPL Parsing Expression Grammars built in to the core library 300+ functions and macros in the core library Interactive environment with detailed stack traces Export your projects to standalone executables with a companion build tool, jpm
gollark: ++delete <@543131534685765673> (redeletion)
gollark: Janet makes a good system scripting language, or a language to embed in other programs. Think Lua or Guile. Janet also can be used for rapid prototyping, dynamic systems, and other domains where dynamic languages shine. Implemented mostly in standard C99, Janet runs on Windows, Linux and macOS. The few features that are not standard C (dynamic library loading, compiler specific optimizations), are fairly straightforward. Janet can be easily ported to new platforms.
gollark: https://janet-lang.org/
gollark: Program in Janet instead.

References

  1. "State Highway Log" (PDF). Pierre region: South Dakota Department of Transportation. January 2011. pp. 72–73. Retrieved December 22, 2011.

KML is from Wikidata
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.