In Bloom by Nirvana

From uunet!decwrl!concert!samba!usenet Wed Jul 22 15:49:34 PDT 1992
Article: 980 of alt.guitar.tab
Newsgroups: alt.guitar.tab
Path: nevada.edu!uunet!decwrl!concert!samba!usenet
From: Ted.Bebenek@bbs.oit.unc.edu (Ted Bebenek)
Subject: Nirvana
Message-ID: <1992Jul22.191357.27534@samba.oit.unc.edu>
Sender: usenet@samba.oit.unc.edu
Nntp-Posting-Host: lambada.oit.unc.edu
Organization: Extended Bulletin Board Service
Date: Wed, 22 Jul 1992 19:13:57 GMT
Lines: 35


In Bloom This is the mane riff played
======== throughout the intro.  The
chorus is a bit different,
---------------------------------------- but I think it uses the same
---------------------------------------- chords.  There is no guitar
---------------------------------------- during the verses, only bass.
--55555-X-22222-X-77777-X-5555-4444-----
--33333-X-00000-X-55555-X-3333-2222-----
----------------------------------------



--
   The opinions expressed are not necessarily those of the University of
     North Carolina at Chapel Hill, the Campus Office for Information
        Technology, or the Experimental Bulletin Board Service.
           internet:  bbs.oit.unc.edu or 152.2.22.80


Comments

Post a Comment

Popular posts from this blog

BOTTOM LIVE script

                                  BOTTOM                                   ======                     by Adrian Edmondson and Rik Mayall                                 Bottom Live                                 ===========                               Richie  Rik Mayall                                Eddie  Adrian Edmondson Introduction ------------ [Opening shot of theatre, with huge pictures of Richie and Eddie. Caption: "Live fro...
Read more

Evidence supporting quantum information processing in animals

              Evidence supporting quantum            information processing in animals                    James A. Donald                    1068 Fulton Av                    Sunnyvale, CA 94089-1505                    USA I show that quantum systems can rapidly solve some problems for which finite state machines require a non- polynomially large time. This class of problems is closely related to the class of problems that animals can solve rapidly and effortlessly, but are intractable for computers by all known algorithms. 1. Introduction      Animals, including very simple animals, can rapidly and effortlessly perceive objects, whereas computers take nonpolynomial time to do this by all...
Read more

ARMIES OF CHAOS

                          ARMIES OF CHAOS -      Before anyone proposes more gun control, he or she should know  about a simple, deadly weapon 4 times as powerful as Dirty Harry's  legendary .44 Magnum -- and at least twice as concealable -- that  _can't_ controlled.        This simple, deadly weapon can be made by anyone -- even a  child -- with unpowered hand tools in an hour's time using $5 worth  of materials, most of which are available around the house anyway.   In traditional form it's reusable an unlimited number of times, and  modern plastics have rendered its disposable version electronically  undetectable.  You can clear a room with such a weapon (more of a  hand-held directional grenade than a gun -- sort of a recycleable  Claymore mine) and it's just one of hundreds of similar time-proven  designs. ...
Read more