Street Sounds Crucial Electro 2
Street Sounds Crucial Electro 2 is the second compilation album in a series and was released 1984 on the StreetSounds label. The album was released on LP and cassette and contains eight electro music and old school hip hop tracks mixed by D.J. Maurice Watson assisted by D.J. Noel Watson/Bunny Rock Inc.[1]
| Street Sounds Crucial Electro 2 | |
|---|---|
 | |
| Compilation album by various artists | |
| Released | 1984 |
| Genre | Electro music, old school hip hop |
| Length | 44:35 |
| Label | StreetSounds |
Track listing
| No. | Title | Artist | Length |
|---|---|---|---|
| 1. | "Two, Three Break" | B Boys | 5:30 |
| 2. | "The Party Scene (Sv)" | The Russell Brothers | 5:33 |
| 3. | "One For The Treble (Fresh)" | Davy DMX | 7:16 |
| 4. | "I'm A Pac Man" | Pac Man | 5:32 |
| No. | Title | Artist | Length |
|---|---|---|---|
| 1. | "Let The Music Play (Dub)" | Shannon | 5:28 |
| 2. | "On The Upside" | Xena | 4:06 |
| 3. | "Planet Rock" | Afrika Bambaataa & The Soul Sonic Force | 5:26 |
| 4. | "Pac Jam (Looking Out For The OVC)" | Jonzun Crew | 5:41 |
gollark: Oh, right, array indexing.
gollark: ```python# parsita-based pseudocode syntax parserfrom stmt import *from parsita import *from parsita.util import constantdef compose(f, g): return lambda x: f(g(x))def map_expr(x): start, end = x if end == "": return start return Op([start, end[1]], end[0])def map_unop_expr(x): return Op(x[1], x[0])def aliases(name, aliases): p = lit(name) for alias in aliases: p |= (lit(alias) > (lambda _: name)) return pclass ExprParser(TextParsers): ε = lit("") IntLit = reg("\-?[0-9]+") > compose(IntLit, int) StrLit = "'" >> reg("[^']*") << "'" > StrLit # TODO escapes (not in "spec" but could be needed) FloatLit = reg("\-?[0-9]+\.[0-9]+") > compose(FloatLit, float) Identifier = reg("[a-zA-Z_]+[a-zA-Z_0-9]*") > Var BracketedExpr = "(" >> Expr << ")" UnaryOperator = lit("NOT") Start = FloatLit | StrLit | IntLit | BracketedExpr | (UnaryOperator & Expr > map_unop_expr) | Identifier # avoid left recursion problems by not doing left recursion # AQA pseudocode does not appear to have a notion of "operator precedence", simplifying parsing logic nicely BinaryOperator = aliases("≤", ["<="]) | aliases("≠", ["!="]) | aliases("≥", [">="]) | lit("DIV") | lit("MOD") | lit("AND") | lit("OR") | reg("[+/*\-=<>]") End = (BinaryOperator & Expr) | ε Expr = (Start & End) > map_exprparse = ExprParser.Expr.parsex = parse("1+2+3 != 6 AND NOT 4 AND x + y")if isinstance(x, Failure): print(x.message)else: print(x.value)```
gollark: <@332271551481118732> Expression parsing is done, I think.
gollark: I wonder if AQA pseudocode *does* have operator precedence. We may need to harvest exam papers.
gollark: This will allow 3% more efficient harnessing of character set anomalies.
References
- "Crucial Electro 2". streetsoundsmusic.co.uk. Retrieved 2010-05-26.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.