1177 replies to this topic

[METHODMAN]

si del sud o del norddddd

[Aioria]

The Lord of the Rings
There are signs on the ring
which make me feel so down
there's one to enslave all rings
to find them all in time
and drive them into darkness
forever they'll be bound
Three for the Kings
of the elves high in light
nine to the mortal
which cry

(solo: Marcus)Ref.: Slow down and I sail on the river
Slow dawn and I walk to the hill
and there's now way out
Mordor

dark land under Sauron's spell
threatened a long time
threatened a long time
Seven rings to the dwarves
in their halls made of stone
into the valley
I feel down
One ring to the dark lord's hand
sitting on his throne
in the land so dark
where I've to go

(solo: Marcus)Ref.: Slow down and I sail on the river
Slow down and I walk to the hill
Lord of the rings

[Sunburn]

Voy a petar el foro
Ni siquiera pienso leer

[mameaddict]

Sus vais a cagaaaaaar!!! A ver si aprendéis un poco:

[code=auto:0]




Network Working Group                                     T. Berners-Lee
Request for Comments: 2396                                       MIT/LCS
Updates: 1808, 1738                                          R. Fielding
Category: Standards Track                                    U.C. Irvine
                                                            L. Masinter
                                                      Xerox Corporation
                                                            August 1998


          Uniform Resource Identifiers (URI): Generic Syntax

Status of this Memo

  This document specifies an Internet standards track protocol for the
  Internet community, and requests discussion and suggestions for
  improvements.  Please refer to the current edition of the "Internet
  Official Protocol Standards" (STD 1) for the standardization state
  and status of this protocol.  Distribution of this memo is unlimited.

Copyright Notice

  Copyright (C) The Internet Society (1998).  All Rights Reserved.

IESG Note

  This paper describes a "superset" of operations that can be applied
  to URI.  It consists of both a grammar and a description of basic
  functionality for URI.  To understand what is a valid URI, both the
  grammar and the associated description have to be studied.  Some of
  the functionality described is not applicable to all URI schemes, and
  some operations are only possible when certain media types are
  retrieved using the URI, regardless of the scheme used.

Abstract

  A Uniform Resource Identifier (URI) is a compact string of characters
  for identifying an abstract or physical resource.  This document
  defines the generic syntax of URI, including both absolute and
  relative forms, and guidelines for their use; it revises and replaces
  the generic definitions in RFC 1738 and RFC 1808.

  This document defines a grammar that is a superset of all valid URI,
  such that an implementation can parse the common components of a URI
  reference without knowing the scheme-specific requirements of every
  possible identifier type.  This document does not define a generative
  grammar for URI; that task will be performed by the individual
  specifications of each URI scheme.




Berners-Lee, et. al.        Standards Track                     [Page 1]

RFC 2396                   URI Generic Syntax                August 1998


1. Introduction

  Uniform Resource Identifiers (URI) provide a simple and extensible
  means for identifying a resource.  This specification of URI syntax
  and semantics is derived from concepts introduced by the World Wide
  Web global information initiative, whose use of such objects dates
  from 1990 and is described in "Universal Resource Identifiers in WWW"
  [RFC1630].  The specification of URI is designed to meet the
  recommendations laid out in "Functional Recommendations for Internet
  Resource Locators" [RFC1736] and "Functional Requirements for Uniform
  Resource Names" [RFC1737].

  This document updates and merges "Uniform Resource Locators"
  [RFC1738] and "Relative Uniform Resource Locators" [RFC1808] in order
  to define a single, generic syntax for all URI.  It excludes those
  portions of RFC 1738 that defined the specific syntax of individual
  URL schemes; those portions will be updated as separate documents, as
  will the process for registration of new URI schemes.  This document
  does not discuss the issues and recommendation for dealing with
  characters outside of the US-ASCII character set [ASCII]; those
  recommendations are discussed in a separate document.

  All significant changes from the prior RFCs are noted in Appendix G.

1.1 Overview of URI

  URI are characterized by the following definitions:

     Uniform
        Uniformity provides several benefits: it allows different types
        of resource identifiers to be used in the same context, even
        when the mechanisms used to access those resources may differ;
        it allows uniform semantic interpretation of common syntactic
        conventions across different types of resource identifiers; it
        allows introduction of new types of resource identifiers
        without interfering with the way that existing identifiers are
        used; and, it allows the identifiers to be reused in many
        different contexts, thus permitting new applications or
        protocols to leverage a pre-existing, large, and widely-used
        set of resource identifiers.

     Resource
        A resource can be anything that has identity.  Familiar
        examples include an electronic document, an image, a service
        (e.g., "today's weather report for Los Angeles"), and a
        collection of other resources.  Not all resources are network
        "retrievable"; e.g., human beings, corporations, and bound
        books in a library can also be considered resources.



Berners-Lee, et. al.        Standards Track                     [Page 2]

RFC 2396                   URI Generic Syntax                August 1998


        The resource is the conceptual mapping to an entity or set of
        entities, not necessarily the entity which corresponds to that
        mapping at any particular instance in time.  Thus, a resource
        can remain constant even when its content---the entities to
        which it currently corresponds---changes over time, provided
        that the conceptual mapping is not changed in the process.

     Identifier
        An identifier is an object that can act as a reference to
        something that has identity.  In the case of URI, the object is
        a sequence of characters with a restricted syntax.

  Having identified a resource, a system may perform a variety of
  operations on the resource, as might be characterized by such words
  as `access', `update', `replace', or `find attributes'.

1.2. URI, URL, and URN

  A URI can be further classified as a locator, a name, or both.  The
  term "Uniform Resource Locator" (URL) refers to the subset of URI
  that identify resources via a representation of their primary access
  mechanism (e.g., their network "location"), rather than identifying
  the resource by name or by some other attribute(s) of that resource.
  The term "Uniform Resource Name" (URN) refers to the subset of URI
  that are required to remain globally unique and persistent even when
  the resource ceases to exist or becomes unavailable.

  The URI scheme (Section 3.1) defines the namespace of the URI, and
  thus may further restrict the syntax and semantics of identifiers
  using that scheme.  This specification defines those elements of the
  URI syntax that are either required of all URI schemes or are common
  to many URI schemes.  It thus defines the syntax and semantics that
  are needed to implement a scheme-independent parsing mechanism for
  URI references, such that the scheme-dependent handling of a URI can
  be postponed until the scheme-dependent semantics are needed.  We use
  the term URL below when describing syntax or semantics that only
  apply to locators.

  Although many URL schemes are named after protocols, this does not
  imply that the only way to access the URL's resource is via the named
  protocol.  Gateways, proxies, caches, and name resolution services
  might be used to access some resources, independent of the protocol
  of their origin, and the resolution of some URL may require the use
  of more than one protocol (e.g., both DNS and HTTP are typically used
  to access an "http" URL's resource when it can't be found in a local
  cache).





Berners-Lee, et. al.        Standards Track                     [Page 3]

RFC 2396                   URI Generic Syntax                August 1998


  A URN differs from a URL in that it's primary purpose is persistent
  labeling of a resource with an identifier.  That identifier is drawn
  from one of a set of defined namespaces, each of which has its own
  set name structure and assignment procedures.  The "urn" scheme has
  been reserved to establish the requirements for a standardized URN
  namespace, as defined in "URN Syntax" [RFC2141] and its related
  specifications.

  Most of the examples in this specification demonstrate URL, since
  they allow the most varied use of the syntax and often have a
  hierarchical namespace.  A parser of the URI syntax is capable of
  parsing both URL and URN references as a generic URI; once the scheme
  is determined, the scheme-specific parsing can be performed on the
  generic URI components.  In other words, the URI syntax is a superset
  of the syntax of all URI schemes.

1.3. Example URI

  The following examples illustrate URI that are in common use.

  ftp://ftp.is.co.za/rfc/rfc1808.txt
     -- ftp scheme for File Transfer Protocol services

  gopher://spinaltap.micro.umn.edu/00/Weather/California/Los%20Angeles
     -- gopher scheme for Gopher and Gopher+ Protocol services

  http://www.math.uio.no/faq/compression-faq/part1.html
     -- http scheme for Hypertext Transfer Protocol services

  mailto:mduerst@ifi.unizh.ch
     -- mailto scheme for electronic mail addresses

  news:comp.infosystems.www.servers.unix
     -- news scheme for USENET news groups and articles

  telnet://melvyl.ucop.edu/
     -- telnet scheme for interactive services via the TELNET Protocol

1.4. Hierarchical URI and Relative Forms

  An absolute identifier refers to a resource independent of the
  context in which the identifier is used.  In contrast, a relative
  identifier refers to a resource by describing the difference within a
  hierarchical namespace between the current context and an absolute
  identifier of the resource.






Berners-Lee, et. al.        Standards Track                     [Page 4]

RFC 2396                   URI Generic Syntax                August 1998


  Some URI schemes support a hierarchical naming system, where the
  hierarchy of the name is denoted by a "/" delimiter separating the
  components in the scheme. This document defines a scheme-independent
  `relative' form of URI reference that can be used in conjunction with
  a `base' URI (of a hierarchical scheme) to produce another URI. The
  syntax of hierarchical URI is described in Section 3; the relative
  URI calculation is described in Section 5.

1.5. URI Transcribability

  The URI syntax was designed with global transcribability as one of
  its main concerns. A URI is a sequence of characters from a very
  limited set, i.e. the letters of the basic Latin alphabet, digits,
  and a few special characters.  A URI may be represented in a variety
  of ways: e.g., ink on paper, pixels on a screen, or a sequence of
  octets in a coded character set.  The interpretation of a URI depends
  only on the characters used and not how those characters are
  represented in a network protocol.

  The goal of transcribability can be described by a simple scenario.
  Imagine two colleagues, Sam and Kim, sitting in a pub at an
  international conference and exchanging research ideas.  Sam asks Kim
  for a location to get more information, so Kim writes the URI for the
  research site on a napkin.  Upon returning home, Sam takes out the
  napkin and types the URI into a computer, which then retrieves the
  information to which Kim referred.

  There are several design concerns revealed by the scenario:

     o  A URI is a sequence of characters, which is not always
        represented as a sequence of octets.

     o  A URI may be transcribed from a non-network source, and thus
        should consist of characters that are most likely to be able to
        be typed into a computer, within the constraints imposed by
        keyboards (and related input devices) across languages and
        locales.

     o  A URI often needs to be remembered by people, and it is easier
        for people to remember a URI when it consists of meaningful
        components.

  These design concerns are not always in alignment.  For example, it
  is often the case that the most meaningful name for a URI component
  would require characters that cannot be typed into some systems.  The
  ability to transcribe the resource identifier from one medium to
  another was considered more important than having its URI consist of
  the most meaningful of components.  In local and regional contexts



Berners-Lee, et. al.        Standards Track                     [Page 5]

RFC 2396                   URI Generic Syntax                August 1998


  and with improving technology, users might benefit from being able to
  use a wider range of characters; such use is not defined in this
  document.

1.6. Syntax Notation and Common Elements

  This document uses two conventions to describe and define the syntax
  for URI.  The first, called the layout form, is a general description
  of the order of components and component separators, as in

     <first>/<second>;<third>?<fourth>

  The component names are enclosed in angle-brackets and any characters
  outside angle-brackets are literal separators.  Whitespace should be
  ignored.  These descriptions are used informally and do not define
  the syntax requirements.

  The second convention is a BNF-like grammar, used to define the
  formal URI syntax.  The grammar is that of [RFC822], except that "|"
  is used to designate alternatives.  Briefly, rules are separated from
  definitions by an equal "=", indentation is used to continue a rule
  definition over more than one line, literals are quoted with "",
  parentheses "(" and ")" are used to group elements, optional elements
  are enclosed in "[" and "]" brackets, and elements may be preceded
  with <n>* to designate n or more repetitions of the following
  element; n defaults to 0.

  Unlike many specifications that use a BNF-like grammar to define the
  bytes (octets) allowed by a protocol, the URI grammar is defined in
  terms of characters.  Each literal in the grammar corresponds to the
  character it represents, rather than to the octet encoding of that
  character in any particular coded character set.  How a URI is
  represented in terms of bits and bytes on the wire is dependent upon
  the character encoding of the protocol used to transport it, or the
  charset of the document which contains it.

  The following definitions are common to many elements:

     alpha    = lowalpha | upalpha

     lowalpha = "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"

     upalpha  = "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"




Berners-Lee, et. al.        Standards Track                     [Page 6]

RFC 2396                   URI Generic Syntax                August 1998


     digit    = "0" | "1" | "2" | "3" | "4" | "5" | "6" | "7" |
                "8" | "9"

     alphanum = alpha | digit

  The complete URI syntax is collected in Appendix A.

2. URI Characters and Escape Sequences

  URI consist of a restricted set of characters, primarily chosen to
  aid transcribability and usability both in computer systems and in
  non-computer communications. Characters used conventionally as
  delimiters around URI were excluded.  The restricted set of
  characters consists of digits, letters, and a few graphic symbols
  were chosen from those common to most of the character encodings and
  input facilities available to Internet users.

     uric          = reserved | unreserved | escaped

  Within a URI, characters are either used as delimiters, or to
  represent strings of data (octets) within the delimited portions.
  Octets are either represented directly by a character (using the US-
  ASCII character for that octet [ASCII]) or by an escape encoding.
  This representation is elaborated below.

2.1 URI and non-ASCII characters

  The relationship between URI and characters has been a source of
  confusion for characters that are not part of US-ASCII. To describe
  the relationship, it is useful to distinguish between a "character"
  (as a distinguishable semantic entity) and an "octet" (an 8-bit
  byte). There are two mappings, one from URI characters to octets, and
  a second from octets to original characters:

  URI character sequence->octet sequence->original character sequence

  A URI is represented as a sequence of characters, not as a sequence
  of octets. That is because URI might be "transported" by means that
  are not through a computer network, e.g., printed on paper, read over
  the radio, etc.

  A URI scheme may define a mapping from URI characters to octets;
  whether this is done depends on the scheme. Commonly, within a
  delimited component of a URI, a sequence of characters may be used to
  represent a sequence of octets. For example, the character "a"
  represents the octet 97 (decimal), while the character sequence "%",
  "0", "a" represents the octet 10 (decimal).




Berners-Lee, et. al.        Standards Track                     [Page 7]

RFC 2396                   URI Generic Syntax                August 1998


  There is a second translation for some resources: the sequence of
  octets defined by a component of the URI is subsequently used to
  represent a sequence of characters. A 'charset' defines this mapping.
  There are many charsets in use in Internet protocols. For example,
  UTF-8 [UTF-8] defines a mapping from sequences of octets to sequences
  of characters in the repertoire of ISO 10646.

  In the simplest case, the original character sequence contains only
  characters that are defined in US-ASCII, and the two levels of
  mapping are simple and easily invertible: each 'original character'
  is represented as the octet for the US-ASCII code for it, which is,
  in turn, represented as either the US-ASCII character, or else the
  "%" escape sequence for that octet.

  For original character sequences that contain non-ASCII characters,
  however, the situation is more difficult. Internet protocols that
  transmit octet sequences intended to represent character sequences
  are expected to provide some way of identifying the charset used, if
  there might be more than one [RFC2277].  However, there is currently
  no provision within the generic URI syntax to accomplish this
  identification. An individual URI scheme may require a single
  charset, define a default charset, or provide a way to indicate the
  charset used.

  It is expected that a systematic treatment of character encoding
  within URI will be developed as a future modification of this
  specification.

2.2. Reserved Characters

  Many URI include components consisting of or delimited by, certain
  special characters.  These characters are called "reserved", since
  their usage within the URI component is limited to their reserved
  purpose.  If the data for a URI component would conflict with the
  reserved purpose, then the conflicting data must be escaped before
  forming the URI.

     reserved    = ";" | "/" | "?" | ":" | "@" | "&" | "=" | "+" |
                   "$" | ","

  The "reserved" syntax class above refers to those characters that are
  allowed within a URI, but which may not be allowed within a
  particular component of the generic URI syntax; they are used as
  delimiters of the components described in Section 3.







Berners-Lee, et. al.        Standards Track                     [Page 8]

RFC 2396                   URI Generic Syntax                August 1998


  Characters in the "reserved" set are not reserved in all contexts.
  The set of characters actually reserved within any given URI
  component is defined by that component. In general, a character is
  reserved if the semantics of the URI changes if the character is
  replaced with its escaped US-ASCII encoding.

2.3. Unreserved Characters

  Data characters that are allowed in a URI but do not have a reserved
  purpose are called unreserved.  These include upper and lower case
  letters, decimal digits, and a limited set of punctuation marks and
  symbols.

     unreserved  = alphanum | mark

     mark        = "-" | "_" | "." | "!" | "~" | "*" | "'" | "(" | ")"

  Unreserved characters can be escaped without changing the semantics
  of the URI, but this should not be done unless the URI is being used
  in a context that does not allow the unescaped character to appear.

2.4. Escape Sequences

  Data must be escaped if it does not have a representation using an
  unreserved character; this includes data that does not correspond to
  a printable character of the US-ASCII coded character set, or that
  corresponds to any US-ASCII character that is disallowed, as
  explained below.

2.4.1. Escaped Encoding

  An escaped octet is encoded as a character triplet, consisting of the
  percent character "%" followed by the two hexadecimal digits
  representing the octet code. For example, "%20" is the escaped
  encoding for the US-ASCII space character.

     escaped     = "%" hex hex
     hex         = digit | "A" | "B" | "C" | "D" | "E" | "F" |
                           "a" | "b" | "c" | "d" | "e" | "f"

2.4.2. When to Escape and Unescape

  A URI is always in an "escaped" form, since escaping or unescaping a
  completed URI might change its semantics.  Normally, the only time
  escape encodings can safely be made is when the URI is being created
  from its component parts; each component may have its own set of
  characters that are reserved, so only the mechanism responsible for
  generating or interpreting that component can determine whether or



Berners-Lee, et. al.        Standards Track                     [Page 9]

RFC 2396                   URI Generic Syntax                August 1998


  not escaping a character will change its semantics. Likewise, a URI
  must be separated into its components before the escaped characters
  within those components can be safely decoded.

  In some cases, data that could be represented by an unreserved
  character may appear escaped; for example, some of the unreserved
  "mark" characters are automatically escaped by some systems.  If the
  given URI scheme defines a canonicalization algorithm, then
  unreserved characters may be unescaped according to that algorithm.
  For example, "%7e" is sometimes used instead of "~" in an http URL
  path, but the two are equivalent for an http URL.

  Because the percent "%" character always has the reserved purpose of
  being the escape indicator, it must be escaped as "%25" in order to
  be used as data within a URI.  Implementers should be careful not to
  escape or unescape the same string more than once, since unescaping
  an already unescaped string might lead to misinterpreting a percent
  data character as another escaped character, or vice versa in the
  case of escaping an already escaped string.

2.4.3. Excluded US-ASCII Characters

  Although they are disallowed within the URI syntax, we include here a
  description of those US-ASCII characters that have been excluded and
  the reasons for their exclusion.

  The control characters in the US-ASCII coded character set are not
  used within a URI, both because they are non-printable and because
  they are likely to be misinterpreted by some control mechanisms.

  control     = <US-ASCII coded characters 00-1F and 7F hexadecimal>

  The space character is excluded because significant spaces may
  disappear and insignificant spaces may be introduced when URI are
  transcribed or typeset or subjected to the treatment of word-
  processing programs.  Whitespace is also used to delimit URI in many
  contexts.

  space       = <US-ASCII coded character 20 hexadecimal>

  The angle-bracket "<" and ">" and double-quote (") characters are
  excluded because they are often used as the delimiters around URI in
  text documents and protocol fields.  The character "#" is excluded
  because it is used to delimit a URI from a fragment identifier in URI
  references (Section 4). The percent character "%" is excluded because
  it is used for the encoding of escaped characters.

  delims      = "<" | ">" | "#" | "%" | <">



Berners-Lee, et. al.        Standards Track                    [Page 10]

RFC 2396                   URI Generic Syntax                August 1998


  Other characters are excluded because gateways and other transport
  agents are known to sometimes modify such characters, or they are
  used as delimiters.

  unwise      = "{" | "}" | "|" | "\" | "^" | "[" | "]" | "`"

  Data corresponding to excluded characters must be escaped in order to
  be properly represented within a URI.

3. URI Syntactic Components

  The URI syntax is dependent upon the scheme.  In general, absolute
  URI are written as follows:

     <scheme>:<scheme-specific-part>

  An absolute URI contains the name of the scheme being used (<scheme>)
  followed by a colon (":") and then a string (the <scheme-specific-
  part>) whose interpretation depends on the scheme.

  The URI syntax does not require that the scheme-specific-part have
  any general structure or set of semantics which is common among all
  URI.  However, a subset of URI do share a common syntax for
  representing hierarchical relationships within the namespace.  This
  "generic URI" syntax consists of a sequence of four main components:

     <scheme>://<authority><path>?<query>

  each of which, except <scheme>, may be absent from a particular URI.
  For example, some URI schemes do not allow an <authority> component,
  and others do not use a <query> component.

     absoluteURI   = scheme ":" ( hier_part | opaque_part )

  URI that are hierarchical in nature use the slash "/" character for
  separating hierarchical components.  For some file systems, a "/"
  character (used to denote the hierarchical structure of a URI) is the
  delimiter used to construct a file name hierarchy, and thus the URI
  path will look similar to a file pathname.  This does NOT imply that
  the resource is a file or that the URI maps to an actual filesystem
  pathname.

     hier_part     = ( net_path | abs_path ) [ "?" query ]

     net_path      = "//" authority [ abs_path ]

     abs_path      = "/"  path_segments




Berners-Lee, et. al.        Standards Track                    [Page 11]

RFC 2396                   URI Generic Syntax                August 1998


  URI that do not make use of the slash "/" character for separating
  hierarchical components are considered opaque by the generic URI
  parser.

     opaque_part   = uric_no_slash *uric

     uric_no_slash = unreserved | escaped | ";" | "?" | ":" | "@" |
                     "&" | "=" | "+" | "$" | ","

  We use the term <path> to refer to both the <abs_path> and
  <opaque_part> constructs, since they are mutually exclusive for any
  given URI and can be parsed as a single component.

3.1. Scheme Component

  Just as there are many different methods of access to resources,
  there are a variety of schemes for identifying such resources.  The
  URI syntax consists of a sequence of components separated by reserved
  characters, with the first component defining the semantics for the
  remainder of the URI string.

  Scheme names consist of a sequence of characters beginning with a
  lower case letter and followed by any combination of lower case
  letters, digits, plus ("+"), period ("."), or hyphen ("-").  For
  resiliency, programs interpreting URI should treat upper case letters
  as equivalent to lower case in scheme names (e.g., allow "HTTP" as
  well as "http").

     scheme        = alpha *( alpha | digit | "+" | "-" | "." )

  Relative URI references are distinguished from absolute URI in that
  they do not begin with a scheme name.  Instead, the scheme is
  inherited from the base URI, as described in Section 5.2.

3.2. Authority Component

  Many URI schemes include a top hierarchical element for a naming
  authority, such that the namespace defined by the remainder of the
  URI is governed by that authority.  This authority component is
  typically defined by an Internet-based server or a scheme-specific
  registry of naming authorities.

     authority     = server | reg_name

  The authority component is preceded by a double slash "//" and is
  terminated by the next slash "/", question-mark "?", or by the end of
  the URI.  Within the authority component, the characters ";", ":",
  "@", "?", and "/" are reserved.



Berners-Lee, et. al.        Standards Track                    [Page 12]

RFC 2396                   URI Generic Syntax                August 1998


  An authority component is not required for a URI scheme to make use
  of relative references.  A base URI without an authority component
  implies that any relative reference will also be without an authority
  component.

3.2.1. Registry-based Naming Authority

  The structure of a registry-based naming authority is specific to the
  URI scheme, but constrained to the allowed characters for an
  authority component.

     reg_name      = 1*( unreserved | escaped | "$" | "," |
                         ";" | ":" | "@" | "&" | "=" | "+" )

3.2.2. Server-based Naming Authority

  URL schemes that involve the direct use of an IP-based protocol to a
  specified server on the Internet use a common syntax for the server
  component of the URI's scheme-specific data:

     <userinfo>@<host>:<port>

  where <userinfo> may consist of a user name and, optionally, scheme-
  specific information about how to gain authorization to access the
  server.  The parts "<userinfo>@" and ":<port>" may be omitted.

     server        = [ [ userinfo "@" ] hostport ]

  The user information, if present, is followed by a commercial at-sign
  "@".

     userinfo      = *( unreserved | escaped |
                        ";" | ":" | "&" | "=" | "+" | "$" | "," )

  Some URL schemes use the format "user:password" in the userinfo
  field. This practice is NOT RECOMMENDED, because the passing of
  authentication information in clear text (such as URI) has proven to
  be a security risk in almost every case where it has been used.

  The host is a domain name of a network host, or its IPv4 address as a
  set of four decimal digit groups separated by ".".  Literal IPv6
  addresses are not supported.

     hostport      = host [ ":" port ]
     host          = hostname | IPv4address
     hostname      = *( domainlabel "." ) toplabel [ "." ]
     domainlabel   = alphanum | alphanum *( alphanum | "-" ) alphanum
     toplabel      = alpha | alpha *( alphanum | "-" ) alphanum



Berners-Lee, et. al.        Standards Track                    [Page 13]

RFC 2396                   URI Generic Syntax                August 1998


     IPv4address   = 1*digit "." 1*digit "." 1*digit "." 1*digit
     port          = *digit

  Hostnames take the form described in Section 3 of [RFC1034] and
  Section 2.1 of [RFC1123]: a sequence of domain labels separated by
  ".", each domain label starting and ending with an alphanumeric
  character and possibly also containing "-" characters.  The rightmost
  domain label of a fully qualified domain name will never start with a
  digit, thus syntactically distinguishing domain names from IPv4
  addresses, and may be followed by a single "." if it is necessary to
  distinguish between the complete domain name and any local domain.
  To actually be "Uniform" as a resource locator, a URL hostname should
  be a fully qualified domain name.  In practice, however, the host
  component may be a local domain literal.

     Note: A suitable representation for including a literal IPv6
     address as the host part of a URL is desired, but has not yet been
     determined or implemented in practice.

  The port is the network port number for the server.  Most schemes
  designate protocols that have a default port number.  Another port
  number may optionally be supplied, in decimal, separated from the
  host by a colon.  If the port is omitted, the default port number is
  assumed.

3.3. Path Component

  The path component contains data, specific to the authority (or the
  scheme if there is no authority component), identifying the resource
  within the scope of that scheme and authority.

     path          = [ abs_path | opaque_part ]

     path_segments = segment *( "/" segment )
     segment       = *pchar *( ";" param )
     param         = *pchar

     pchar         = unreserved | escaped |
                     ":" | "@" | "&" | "=" | "+" | "$" | ","

  The path may consist of a sequence of path segments separated by a
  single slash "/" character.  Within a path segment, the characters
  "/", ";", "=", and "?" are reserved.  Each path segment may include a
  sequence of parameters, indicated by the semicolon ";" character.
  The parameters are not significant to the parsing of relative
  references.





Berners-Lee, et. al.        Standards Track                    [Page 14]

RFC 2396                   URI Generic Syntax                August 1998


3.4. Query Component

  The query component is a string of information to be interpreted by
  the resource.

     query         = *uric

  Within a query component, the characters ";", "/", "?", ":", "@",
  "&", "=", "+", ",", and "$" are reserved.

4. URI References

  The term "URI-reference" is used here to denote the common usage of a
  resource identifier.  A URI reference may be absolute or relative,
  and may have additional information attached in the form of a
  fragment identifier.  However, "the URI" that results from such a
  reference includes only the absolute URI after the fragment
  identifier (if any) is removed and after any relative URI is resolved
  to its absolute form.  Although it is possible to limit the
  discussion of URI syntax and semantics to that of the absolute
  result, most usage of URI is within general URI references, and it is
  impossible to obtain the URI from such a reference without also
  parsing the fragment and resolving the relative form.

     URI-reference = [ absoluteURI | relativeURI ] [ "#" fragment ]

  The syntax for relative URI is a shortened form of that for absolute
  URI, where some prefix of the URI is missing and certain path
  components ("." and "..") have a special meaning when, and only when,
  interpreting a relative path.  The relative URI syntax is defined in
  Section 5.

4.1. Fragment Identifier

  When a URI reference is used to perform a retrieval action on the
  identified resource, the optional fragment identifier, separated from
  the URI by a crosshatch ("#") character, consists of additional
  reference information to be interpreted by the user agent after the
  retrieval action has been successfully completed.  As such, it is not
  part of a URI, but is often used in conjunction with a URI.

     fragment      = *uric

  The semantics of a fragment identifier is a property of the data
  resulting from a retrieval action, regardless of the type of URI used
  in the reference.  Therefore, the format and interpretation of
  fragment identifiers is dependent on the media type [RFC2046] of the
  retrieval result.  The character restrictions described in Section 2



Berners-Lee, et. al.        Standards Track                    [Page 15]

RFC 2396                   URI Generic Syntax                August 1998


  for URI also apply to the fragment in a URI-reference.  Individual
  media types may define additional restrictions or structure within
  the fragment for specifying different types of "partial views" that
  can be identified within that media type.

  A fragment identifier is only meaningful when a URI reference is
  intended for retrieval and the result of that retrieval is a document
  for which the identified fragment is consistently defined.

4.2. Same-document References

  A URI reference that does not contain a URI is a reference to the
  current document.  In other words, an empty URI reference within a
  document is interpreted as a reference to the start of that document,
  and a reference containing only a fragment identifier is a reference
  to the identified fragment of that document.  Traversal of such a
  reference should not result in an additional retrieval action.
  However, if the URI reference occurs in a context that is always
  intended to result in a new request, as in the case of HTML's FORM
  element, then an empty URI reference represents the base URI of the
  current document and should be replaced by that URI when transformed
  into a request.

4.3. Parsing a URI Reference

  A URI reference is typically parsed according to the four main
  components and fragment identifier in order to determine what
  components are present and whether the reference is relative or
  absolute.  The individual components are then parsed for their
  subparts and, if not opaque, to verify their validity.

  Although the BNF defines what is allowed in each component, it is
  ambiguous in terms of differentiating between an authority component
  and a path component that begins with two slash characters.  The
  greedy algorithm is used for disambiguation: the left-most matching
  rule soaks up as much of the URI reference string as it is capable of
  matching.  In other words, the authority component wins.

  Readers familiar with regular expressions should see Appendix B for a
  concrete parsing example and test oracle.

5. Relative URI References

  It is often the case that a group or "tree" of documents has been
  constructed to serve a common purpose; the vast majority of URI in
  these documents point to resources within the tree rather than





Berners-Lee, et. al.        Standards Track                    [Page 16]

RFC 2396                   URI Generic Syntax                August 1998


  outside of it.  Similarly, documents located at a particular site are
  much more likely to refer to other resources at that site than to
  resources at remote sites.

  Relative addressing of URI allows document trees to be partially
  independent of their location and access scheme.  For instance, it is
  possible for a single set of hypertext documents to be simultaneously
  accessible and traversable via each of the "file", "http", and "ftp"
  schemes if the documents refer to each other using relative URI.
  Furthermore, such document trees can be moved, as a whole, without
  changing any of the relative references.  Experience within the WWW
  has demonstrated that the ability to perform relative referencing is
  necessary for the long-term usability of embedded URI.

  The syntax for relative URI takes advantage of the <hier_part> syntax
  of <absoluteURI> (Section 3) in order to express a reference that is
  relative to the namespace of another hierarchical URI.

     relativeURI   = ( net_path | abs_path | rel_path ) [ "?" query ]

  A relative reference beginning with two slash characters is termed a
  network-path reference, as defined by <net_path> in Section 3.  Such
  references are rarely used.

  A relative reference beginning with a single slash character is
  termed an absolute-path reference, as defined by <abs_path> in
  Section 3.

  A relative reference that does not begin with a scheme name or a
  slash character is termed a relative-path reference.

     rel_path      = rel_segment [ abs_path ]

     rel_segment   = 1*( unreserved | escaped |
                         ";" | "@" | "&" | "=" | "+" | "$" | "," )

  Within a relative-path reference, the complete path segments "." and
  ".." have special meanings: "the current hierarchy level" and "the
  level above this hierarchy level", respectively.  Although this is
  very similar to their use within Unix-based filesystems to indicate
  directory levels, these path components are only considered special
  when resolving a relative-path reference to its absolute form
  (Section 5.2).

  Authors should be aware that a path segment which contains a colon
  character cannot be used as the first segment of a relative URI path
  (e.g., "this:that"), because it would be mistaken for a scheme name.




Berners-Lee, et. al.        Standards Track                    [Page 17]

RFC 2396                   URI Generic Syntax                August 1998


  It is therefore necessary to precede such segments with other
  segments (e.g., "./this:that") in order for them to be referenced as
  a relative path.

  It is not necessary for all URI within a given scheme to be
  restricted to the <hier_part> syntax, since the hierarchical
  properties of that syntax are only necessary when relative URI are
  used within a particular document.  Documents can only make use of
  relative URI when their base URI fits within the <hier_part> syntax.
  It is assumed that any document which contains a relative reference
  will also have a base URI that obeys the syntax.  In other words,
  relative URI cannot be used within a document that has an unsuitable
  base URI.

  Some URI schemes do not allow a hierarchical syntax matching the
  <hier_part> syntax, and thus cannot use relative references.

5.1. Establishing a Base URI

  The term "relative URI" implies that there exists some absolute "base
  URI" against which the relative reference is applied.  Indeed, the
  base URI is necessary to define the semantics of any relative URI
  reference; without it, a relative reference is meaningless.  In order
  for relative URI to be usable within a document, the base URI of that
  document must be known to the parser.

  The base URI of a document can be established in one of four ways,
  listed below in order of precedence.  The order of precedence can be
  thought of in terms of layers, where the innermost defined base URI
  has the highest precedence.  This can be visualized graphically as:

     .----------------------------------------------------------.
     |  .----------------------------------------------------.  |
     |  |  .----------------------------------------------.  |  |
     |  |  |  .----------------------------------------.  |  |  |
     |  |  |  |  .----------------------------------.  |  |  |  |
     |  |  |  |  |       <relative_reference>       |  |  |  |  |
     |  |  |  |  `----------------------------------'  |  |  |  |
     |  |  |  | (5.1.1) Base URI embedded in the       |  |  |  |
     |  |  |  |         document's content             |  |  |  |
     |  |  |  `----------------------------------------'  |  |  |
     |  |  | (5.1.2) Base URI of the encapsulating entity |  |  |
     |  |  |         (message, document, or none).        |  |  |
     |  |  `----------------------------------------------'  |  |
     |  | (5.1.3) URI used to retrieve the entity            |  |
     |  `----------------------------------------------------'  |
     | (5.1.4) Default Base URI is application-dependent        |
     `----------------------------------------------------------'



Berners-Lee, et. al.        Standards Track                    [Page 18]

RFC 2396                   URI Generic Syntax                August 1998


5.1.1. Base URI within Document Content

  Within certain document media types, the base URI of the document can
  be embedded within the content itself such that it can be readily
  obtained by a parser.  This can be useful for descriptive documents,
  such as tables of content, which may be transmitted to others through
  protocols other than their usual retrieval context (e.g., E-Mail or
  USENET news).

  It is beyond the scope of this document to specify how, for each
  media type, the base URI can be embedded.  It is assumed that user
  agents manipulating such media types will be able to obtain the
  appropriate syntax from that media type's specification.  An example
  of how the base URI can be embedded in the Hypertext Markup Language
  (HTML) [RFC1866] is provided in Appendix D.

  A mechanism for embedding the base URI within MIME container types
  (e.g., the message and multipart types) is defined by MHTML
  [RFC2110].  Protocols that do not use the MIME message header syntax,
  but which do allow some form of tagged metainformation to be included
  within messages, may define their own syntax for defining the base
  URI as part of a message.

5.1.2. Base URI from the Encapsulating Entity

  If no base URI is embedded, the base URI of a document is defined by
  the document's retrieval context.  For a document that is enclosed
  within another entity (such as a message or another document), the
  retrieval context is that entity; thus, the default base URI of the
  document is the base URI of the entity in which the document is
  encapsulated.

5.1.3. Base URI from the Retrieval URI

  If no base URI is embedded and the document is not encapsulated
  within some other entity (e.g., the top level of a composite entity),
  then, if a URI was used to retrieve the base document, that URI shall
  be considered the base URI.  Note that if the retrieval was the
  result of a redirected request, the last URI used (i.e., that which
  resulted in the actual retrieval of the document) is the base URI.

5.1.4. Default Base URI

  If none of the conditions described in Sections 5.1.1--5.1.3 apply,
  then the base URI is defined by the context of the application.
  Since this definition is necessarily application-dependent, failing





Berners-Lee, et. al.        Standards Track                    [Page 19]

RFC 2396                   URI Generic Syntax                August 1998


  to define the base URI using one of the other methods may result in
  the same content being interpreted

[WoodElf]

Bienvenue sur
Lycos MultiMania
Pages perso



S'identifier
Mon compte

S'inscrire
Visite guidée


Nom de domaine gratuit**



.com.net.org.biz.info






50Mo d'espace
Goodies sympas
Stats perso
PHP4U/MySQL
Plus d'infos



Votre nom de domaine
Outils de création
200 comptes e-mail
300 Mo espace disque
Support

Lycos Webcenter !



Votre site en 10 minutes ! A partir de 3,5 €* par mois Nouveau !




Construire son site


WebBuilder


PHP4U/MySQL


Goodies


Lycos Stats


WebFTP




Promouvoir son site


Enregistrer son site


Outils de promotion




Chaîne Webmaster


Astuces et scripts


Ateliers Technique


Ateliers Graphique


Ateliers Multimédia


Forums




Forums


Forums MultiMania


Tous les forums


Mon profil


Créer un forum


Administrer mes forums




Offres spéciales


Service Premium


Nom de domaine gratuit


Gagnez de l'argent !




Support


Aide


FAQ


Lexique


Reporter un bug


Infos MultiMania




* Prix indicatif pour le pack Découverte

** Pour toute souscription d'un an à l'un des Packs d'hébergement




Livre d’or pour votre site
Donnez à vos visiteurs l’opportunité de vous laisser des messages et de vous complimenter sur votre site Web ! Webmaster e-formation
Découvrez toutes les techniques de création de site à votre propre rythme pour 12€ par an.


Recherche


Trouver : AnnuaireWebmasterWeb



Actualités et médias
Informations locales, E-zines

Art et Culture
Cinéma, Bd, Littérature

Associations
Asso. étudiantes, sportives

Charme
Galerie photos , Videos, Mangas X

Divertissement
Humour, Télévision, Jeux de rôle

Enseignement et emploi
Cv, Formation

Famille
Albums de famille, Enfants

Finance et économie
Bourse, Economie et gestion

Informatique et Télécoms
Programmation, Internet, Logiciels

Jeux vidéo
Guildes, Trucs, Genres

Loisirs et Hobbies
Auto, moto, Généalogie, Collections

Musique
Infos Générales, Compositeurs, Labels

Santé et beauté
Médecine, Nutrition, Beauté

Sciences et technologies
Sciences parallèles, humaines

Société et communautés
Communautés, Rencontres

Sports
Sports d'équipe, de combat

Tourisme et voyages
Carnets de voyage, Infos pratiques

Les Inclassables
Conspiration, Humeurs






Annuaire www.scoot.fr
Activité :
Nom :
Localité :












--------------------------------------------------------------------------------
Lycos dans le monde :
--------------------------------------------------------------------------------

Europe: Autriche, Belgique, Danemark, Royaume-Uni, Allemagne, Italie, Pays-Bas, Norvège, Suède, Suisse, Espagne, Russie
International : Etats-Unis (anglais), Etats-Unis (espagnol), Asie

--------------------------------------------------------------------------------

Espace Annonceurs | Ajouter un site sur Lycos | Conditions générales | Signaler un abus | Support


Copyright © 2001 Lycos, Inc. Tous droits réservés.
Lycos® est une marque déposée de Carnegie Mellon University

[Deadsunrise]

cambia de frase sunbirn

[Akira88]

Nostradamus Centurias

1. CENTURIA I
I
De noche, sentado y en secreto estudio.
Tranquilo y solo, en la silla de bronce:
Exigua llama saliendo de la soledad,
Hace prosperar lo que no debe creerse en vano.
II
La vara en la mano entre los sacerdotes de Apolo
Por la onda bañada la orla y el pie:
Un miedo y una voz vibran por las mangas:
Esplendor divino. El divino se sienta a mi lado.
III
Cuando la litera por el torbellino se vuelque.
Y los rostros cubiertos por sus capas.
La república por las gentes nuevas vejadas,
Entonces blancos y rojos juzgarán al revés.
IV
Habrá un monarca para el Universo
Que no estará mucho tiempo en paz y con la vida:
Entonces se perderá la barca pesquera.
Se enfrentará al mayor desastre.
V
Perseguidos lo serán para que dure el combate
Por el campo serán más fuertemente oprimidos:
Burgo y ciudad sostendrán mayores luchas
Carcas. Narbonne acabarán extenuadas.
VI
El ojo de Ravenna quedará destituído.
Cuando fallen las alas de sus pies:
Los dos de Brescia habrán reconstruído.
Torino. Vercelli que Galos arrasaron.
VII
Tarde llegado, la ejecución cumplida.
Los vientos contrarios, cartas tomadas por el camino:
Los conjurados XIIIJ de una secta.
Por Rousseau cercenadas las empresas.
VIII
Cuantas veces tomada la ciudad solar
serán cambiadas las leyes bárbaras y vanas:
Tu mal se acerca. Ya no más tributaria
El gran Adriano recorrerá tus venas.
IX
De Oriente vendrá el corazón Púnico
A hostigar a Adriano y a los herederos de Rómulo
Acompañado de la flota Líbica.
Temblando los Malteses y los de las vacías islas cercanas.
X
Serpientes llevadas en jaulas de hierro
Donde los séptimos hijos del Rey son presos
Los viejos y los padres saldrán de su infierno profundo,
para ver morir su fruto con muerte y grito.
XI
El movimiento de los sentidos, corazón, pies y manos
Estarán de acuerdo Nápoles, Lyon y Sicilia
Espadas, fuegos, aguas luego a los nobles Romanos,
Caed, matad, muertos por su débil cerebro.
XII
A poco dirá la hoz brutal y frágil.
De bajo en alto levantada con presteza.
Luego al instante desleal y lábil.
Quien en Verona tendrá el gobierno.
XII
Los exiliados por ira, odio intestino,
Harán al Rey gran conjura:
Secretamente meterán al enemigo por la galería.
Y a sus viejos deudos contra ellos alzarán.
XIV
De la gente esclava canciones, cantos y peticiones.
Cautivos por Príncipes y Señores en las prisiones:
Al porvenir por idiotas sin cabezas,
Serán recibidos por oraciones divinas.
XV
Marte nos amenaza por la fuerza bélica
Setenta veces hará la sangre esparcirse:
Auge y ruina del Eclesiástico,
Y más quienes de ellos nada querrían oir.
XVI
Hoz en el estanque hacia Sagitario,
En su elevada cumbre de exaltación,
Peste, hambruna, muerte por mano militar,
El siglo se acerca a su renovación.
XVII
Durante cuarenta años el Iris no aparecerá,
Durante cuarenta años todos los días será visto:
La tierra árida en sequía crecerá,
Y gran diluvio cuando sea visto.
XVIII
Por la discorde negligencia Gala
Será paso a Mahoma abierto:
De sangre empapada la tierra y el mar del Sena,
El puerto Foceo de velas y naves cubierto.
XIX
Cuando serpientes vengan a circundar al ara.
La sangre Troyana vejado por las Españas:
Por ellos gran número habrán sido mermadas,
Jefe huye, escondido en el pantano entre cañas.
XX
Tours, Orleans, Blois, Angers, Reims y Nantes
Ciudades vejadas por el repentino cambio,
Por lenguas extrañas se levantarán tiendas.
Ríos, dardos, caballería haciendo temblar tierra y mar.
XXI
Profunda arcilla blanca nutre la roca.
Que de un abismo surgirá láctea.
En vano turbados no osarán tocarla.
Ignorando ser en el fondo tierra arcillosa.
XXII
Lo que vivirá y no teniendo sentido alguno,
Vendrá a dañar de muerte a su artífice,
Autun, Chalons, Langres y los dos Senas.
El granizo y el hielo harán gran maleficio.
XXIII
El mes tercero al levantarse el sol.
Jabalí leopardo, en el campo de Marte para combatir.
Leopardo tumbado al cielo extiende su mirada.
Un águila alrededor del sol ve abatirse.
XXIV
En la ciudad nueva pensativo para condenar.
El pájaro de presa al cielo acaba de ofrecerse:
Después de la victoria a los cautivos perdonar.
Cremona y Mantua grandes males habrán sufrido.
XXV
Perdido, encontrado, escondido tanto tiempo.
Será pastor semidiós honrado:
Cuando la luan acabe su gran siglo.
Por otros vientos será deshonrado.
XXVI
El gran rayo cae en hora diurna.
Mal y predicho or portador postulario:
Siguiente presagio cae en hora nocturna,
Conflicto en Reims. Londres: Etrusca pestífera.
XXVII
Bajo la sierra de guayana del cielo golpeada,
No lejos de allá está escondido el tesoro,
Que por largos siglos ha estado cerrado,
Morirá quien lo encuentre, el ojo atravesado por resorte.
XXVIII
La torre de Boucq temerá la fusta bárbara.
Un tiempo, largo tiempo después de la barca hespérica
Ganado, gente, muebles, los dos harán gran daño
Tauro y Libra ¿qué mortal puntada?
XXIX
Cuando el pez terrestre y acuático
Por fuerza vaga al suelo sea llevada.
Su forma extraña suave y horrorosa,
Por mar a los muros muy pronto los enemigos.
XXX
La nave extraña por la tormenta marina,
Abordará cerca de puerto desconocido:
No obstante los signos de rama de palma,
Después de muerte lelga buen consejo tarde venido.
XXXI
Tantos años en Galia las guerras durarán,
Lejos de la carrera del Castulón monarca:
Victoria incierta tres grandes coronarán.
Águilas, Gallo, Luna, León. Sol en marca.
XXXII
El gran Imperio será pronto trasladado
En lugar pequeño, que bien pronto crecerá.
Lugar bien ínfimo de exiguo condado.
Donde en medio vendrá a poner su cetro.
XXXIII
Cerca de un gran puente de llanura espaciosa.
El gran Lyon por fuerzas Cesáreas.
Hará abatir fuera de la ciudad rigurosa.
Por temor las puertas le serán cerradas.
XXXIV
El pájaro de presa volando a la ventana.
Antes del conflicto hace a los franceses honor,
Uno por bueno lo aceptará, uno por ambiguo siniestro:
La parte débil tendrá por buen presagio.
XXXV
El león joven al viejo sobrepasará,
En campo bélico por singular duelo,
En jaula de oro los ojos le atravesará,
Dos choques uno después morir muerte cruel.
XXXVI
Tarde la Monarquía se arrepentirá,
De no haber dado muerte a su adversario,
Pero acabará mucho más consintiendo,
Que toda su sangre por muerte hará deshacer.
XXXVII
Un poco antes que el Sol se oculte
Habrá lucha, grandes multitudes justicieras.
Se unirán, del puerto marino no hay respuesta,
Puente y sepulcro en dos lugares extraños.
XXXVIII
El Sol y el Águila al vencedor juntarán.
Respuesta vana al vacuo le aseguran,
Cuerno ni puñal podrán ser retenidos.
Vindicta paz si acaba a tiempo frenada.
XXXIX
De noche en la cama el supremo estrangula.
Por haber permanecido demasiado rubia elegida.
Por tres el Imperio reemplazado agotado.
A muerte llevará carta, y paquete no leídos.
XL
La tromba falsa disimulando locura.
Hará Bizancio un cambio de leyes.
Saldrá de Egipto, que quiere que se desate.
Edicto cambiando moneda y valor.
XLI
Sitio en ciudad es de noche asaltada.
Pocos escapados, no lejos del mar conflicto,
Mujer de placer, regreso hijo desfallecido.
Veneno y cartas escondidos en el pliego.
XLII
La décima Calenda de abril de hecho gótico.
Resucitado de nuevo por gentes malignas,
El fuego extinto, asamblea diabólica.
Buscando los huesos de d'Amant y Pselin.
XLIII
Antes de que llegue el cambio de Imperio,
Llegará un caso maravilloso,
El campamento enmudecido, el pilar de Porfirio
Puesto, transmutado bajo la roca retorcida.
XLIV
En breve volverán sacrificios.
Contraventores serán llevados al martirio:
No habrán más monjes, abates, ni novicios,
La miel será mucho más cara que la cera.
XLV
Sectario de sectas gran pena al delator
Bestia en teatro, levantado el juego escénico,
De hecho antiguo ennoblecido el inventor.
Por sectas mundo confuso y cismático.
XLVI
Muy cerca de Aux, de Lestore y Miranda,
Gran fuego del cielo en tres noches caerá:
Causa sucederá muy estupenda y asombrosa.
Muy poco después la tierra temblará.

[bregamutero]

estoy tentado en meteros mi tesina

[weemoose]

Tranquilo sunburn,no sera el primero ni el ultimo mal conductor pero no creo q sea buena tactica meter las tias en tu carro.


Se marean y luego manchan la tapiceria.Hay q tener preferencias.

[shoryu]

[METHODMAN]

i sa demostrat sa demostrat

[walsen]

Dos finales 1.2

por Charles Champ d'Hiers

Desde luego aquella noche no estaba siendo la mejor de la vida de mi novia. Además del enfado que tenía conmigo, además de ver como su amiga Silvia se cogía una borrachera de esas que hacen historia y además de comprobar que ni el novio de ésta, Raúl, ni yo, le andábamos muy a la zaga en eso de beber demasiado, tenía que soportar como aquel grupo de niñatos le estaban diciendo de todo desde el momento en que había llegado al lugar donde tenía el coche aparcado.

[Joputa]

hasta que cuando se volvio a tirar uno de ellos la gente se aparto y el pive se pego un costalazo de kilo en el suelo.... lo que me pude despollar xDDDD

[Ulric]

¿qué ocurre cuando dos mujeres se encuentran por la calle...? ¿Y dos
hombres?

Se encuentran dos mujeres por la calle.

- ¡¡María!! ¿Qué tal? No te había conocido... con ese peinado tan
maravilloso que te has puesto...

- Ay, Laurita. Vengo de la pelu ahora mismo. Es que Adolfo es un artista.

- Oye... ¿eso son mechas o es rubio natural?

- Son mechas, boba.

- Pues estás divina. Se te va a comer tu marido en cuanto te vea, que tiene
una mujer que no se la merece.

- No seas tonta, que tú sí que estás guapísima. Hija, es que siempre has
tenido una clase...¡Oye! ¡Pero qué bolso más divino! ¿Te lo ha regalado tu
Julián?

- ¡Qué va! Ese ya no me regala nada. Todo el día viendo el fútbol y tomando
cerveza con los amigotes...

- Ah, pues eso sí que no puede ser. Ya le estás diciendo que o te mima más o
te vas con algún jovencito del trabajo, que deben estar partiéndose la cara
por ti.

- Ay, que cosas dices. Bueno, mi amor, que a ver si nos vemos, y salimos de
compras y a tomar café que nos tenemos que contar muchas cositas...

- Pues claro, cielo. Te llamo la semana que viene sin falta.

- Bueno, preciosa. No te digo que te cuides porque como te cuides más nos
vas a dejar a todas a la altura del betún, que estás divina.

Se dan dos besos y un abrazo y se separan.

PENSAMIENTO DE LA PRIMERA MUJER:

"Anda, que lo que se ha hecho en el pelo, la hija de la gran puta. Menudo
adefesio. Yo no sé cómo su marido sigue casado con ella, con lo bueno que
está. Me cago en su puta madre... las hay que nacen con suerte. Y hay que
ver cómo apesta a perfume barato la muy zorra. Ésta no consigue que la
violen ni en Alcalá Meco. Siempre ha sido un cayo, y además vulgar, que es
lo que más me jode."

PENSAMIENTO DE LA SEGUNDA MUJER:

"Mira que es mala suerte tener que encontrarme al zorrón este, con lo mal
que me cae. Y se ha superado, la cabrona. Está más fea que nunca. Y menudo
bolso. Y menudos zapatos y menudo todo. A saber en qué mercadillo se compra
la ropa, la hija de puta, que se cree que tiene veinte años y va haciendo el
ridículo por la calle, la muy perra."

En la otra punta de la ciudad se encuentran dos hombres.

- Coño! Pero si es el tontolculo del Mariano.

- ¿Qué pasa, gilipollas?

- Pues nada, lo de siempre, que cada vez te veo más calvo.

¿Por qué no te compras un peluquín de una puta vez, y dejas de ir dando el
cante por la calle con la calva esa, que parece una pista de aterrizaje para
ovnis?

-Porque prefiero raparle el coño a tu puta madre, que con los pelánganos que
tiene me voy a hacer una peluca que voy a parecer una estrella del rock. Lo
malo es el olor, que no veas si le canta la chirla a la hija de puta.

- Ya ves. Como a tu mujer, que cada vez que me la follo me tengo que
restregar la polla con Ajax pino.

- Pues te durarán un huevo los botes, porque tu parienta me ha dicho que
tienes menos rabo que el hermano pequeño de David el Gnomo.

- Mi parienta no tiene ni puta idea de nada, cabronazo. ¿No ves que fue
novia tuya hasta que la metí el pollazo?

- Y menudo favor me hiciste, capullo, que con lo zorra que es... En el
instituto se la tiraron hasta los del equipo de ajedrez.

- Bueno, idiota, que me piro. Te veo otro día.

- No si yo te veo antes, mamón. Ala, que te jodan.

- Y tú que lo veas, gilipollas.

Se dan un golpecito en el hombro y se separan.

PENSAMIENTO DEL PRIMER HOMBRE

"Joder, cuánto tiempo sin ver al Mariano. Que tío más de puta madre. Y está
hecho un chaval, el jodío. A ver si le llamo la semana que viene, hombre,
que me jode un huevo perder el contacto con tíos como este."

PENSAMIENTO DEL SEGUNDO HOMBRE

"Mira que es majete el cabrón del Antonio. Me descojono con él. Si no fuera
con prisa me lo había llevado de cañas. El martes o el miércoles le llamo, y
llamo también al Paco, que hace que no nos juntamos, y nos pasamos una tarde
de puta madre los tres."

[Ligreman]

Parte C (con esto ha de petar)

//************* BUSCA EPISODIOS **************************
public Vector buscaEpisodio(String ep, String num)
{
Vector resultado = new Vector(0);

try
{
String linea = "";
int i = 0;

ep = ep.toUpperCase();
char c = ep.charAt(0);

if ((c == 'A') || (c == 'B') || (c == 'C') || (c == 'D'))
{
BufferedReader f1 = new BufferedReader(new FileReader(file1));
while ((linea = f1.readLine()) != null)
{
String auxiline = cogeCampo(1,linea);
String auxiline2 = cogeCampo(2,linea);
int j = ep.compareTo(auxiline);
int k = num.compareTo(auxiline2);
if ((j == 0) && (k == 0))
{
resultado.addElement("" + linea);
//resultado.addElement("" + cogeCampo(1,linea) + " - Episodio " + cogeCampo(2,linea));
}
i++;
progreso.setValue(i);
}
f1.close();
}//if ABCD

if ((c == 'E') || (c == 'F') || (c == 'G') || (c == 'H'))
{
BufferedReader f2 = new BufferedReader(new FileReader(file2));
while ((linea = f2.readLine()) != null)
{
String auxiline = cogeCampo(1,linea);
String auxiline2 = cogeCampo(2,linea);
int j = ep.compareTo(auxiline);
int k = num.compareTo(auxiline2);
if ((j == 0) && (k == 0))
{
resultado.addElement("" + linea);
//resultado.addElement("" + cogeCampo(1,linea) + " - Episodio " + cogeCampo(2,linea));
}
i++;
progreso.setValue(i);
}
f2.close();
}//if EFGH

if ((c == 'I') || (c == 'J') || (c == 'K') || (c == 'L'))
{
BufferedReader f3 = new BufferedReader(new FileReader(file3));
while ((linea = f3.readLine()) != null)
{
String auxiline = cogeCampo(1,linea);
String auxiline2 = cogeCampo(2,linea);
int j = ep.compareTo(auxiline);
int k = num.compareTo(auxiline2);
if ((j == 0) && (k == 0))
{
resultado.addElement("" + linea);
//resultado.addElement("" + cogeCampo(1,linea) + " - Episodio " + cogeCampo(2,linea));
}
i++;
progreso.setValue(i);
}
f3.close();
}//if IJKL

if ((c == 'M') || (c == 'N') || (c == 'O') || (c == 'P') || (c == 'Q'))
{
BufferedReader f4 = new BufferedReader(new FileReader(file4));
while ((linea = f4.readLine()) != null)
{
String auxiline = cogeCampo(1,linea);
String auxiline2 = cogeCampo(2,linea);
int j = ep.compareTo(auxiline);
int k = num.compareTo(auxiline2);
if ((j == 0) && (k == 0))
{
resultado.addElement("" + linea);
//resultado.addElement("" + cogeCampo(1,linea) + " - Episodio " + cogeCampo(2,linea));
}
i++;
progreso.setValue(i);
}
f4.close();
}//if MNOPQ

if ((c == 'R') || (c == 'S') || (c == 'T') || (c == 'U'))
{
BufferedReader f5 = new BufferedReader(new FileReader(file5));
while ((linea = f5.readLine()) != null)
{
String auxiline = cogeCampo(1,linea);
String auxiline2 = cogeCampo(2,linea);
int j = ep.compareTo(auxiline);
int k = num.compareTo(auxiline2);
if ((j == 0) && (k == 0))
{
resultado.addElement("" + linea);
//resultado.addElement("" + cogeCampo(1,linea) + " - Episodio " + cogeCampo(2,linea));
}
i++;
progreso.setValue(i);
}
f5.close();
}//if RSTU

if ((c == 'V') || (c == 'W') || (c == 'X') || (c == 'Y') || (c == 'Z'))
{
BufferedReader f6 = new BufferedReader(new FileReader(file6));
while ((linea = f6.readLine()) != null)
{
String auxiline = cogeCampo(1,linea);
String auxiline2 = cogeCampo(2,linea);
int j = ep.compareTo(auxiline);
int k = num.compareTo(auxiline2);
if ((j == 0) && (k == 0))
{
resultado.addElement("" + linea);
//resultado.addElement("" + cogeCampo(1,linea) + " - Episodio " + cogeCampo(2,linea));
}
i++;
progreso.setValue(i);
}
f6.close();
}//if VWXYZ
progreso.setValue(100);
}
catch (java.io.IOException ioex) {status("Error de entrada / salida");}
catch (NullPointerException npex){status("Excepción de puntero nulo");}

if (resultado.size() == 0)
{
status("Ningún registro encontrado");
}
return resultado;
}

//******************* muestraSeries(String serie) ********************
//********************************************************************
//********************************************************************
public void muestraSeries(String serie)
{
try
{
char c = serie.charAt(0);
String linea = "";
String linea2 = "";
Vector resultado = new Vector(0);

if ((c == 'A') || (c == 'B') || (c == 'C') || (c == 'D'))
{
BufferedReader f1 = new BufferedReader(new FileReader(file1));
while ((linea = f1.readLine()) != null)
{
linea2 = cogeCampo(1, linea);
if (serie.compareTo(linea2) == 0)
{
resultado.addElement(linea);
}
}
}

if ((c == 'E') || (c == 'F') || (c == 'G') || (c == 'H'))
{
BufferedReader f2 = new BufferedReader(new FileReader(file2));
while ((linea = f2.readLine()) != null)
{
linea2 = cogeCampo(1, linea);
if (serie.compareTo(linea2) == 0)
{
resultado.addElement(linea);
}
}
}

if ((c == 'I') || (c == 'J') || (c == 'K') || (c == 'L'))
{
BufferedReader f3 = new BufferedReader(new FileReader(file3));
while ((linea = f3.readLine()) != null)
{
linea2 = cogeCampo(1, linea);
if (serie.compareTo(linea2) == 0)
{
resultado.addElement(linea);
}
}
}

if ((c == 'M') || (c == 'N') || (c == 'O') || (c == 'P') || (c == 'Q'))
{
BufferedReader f4 = new BufferedReader(new FileReader(file4));
while ((linea = f4.readLine()) != null)
{
linea2 = cogeCampo(1, linea);
if (serie.compareTo(linea2) == 0)
{
resultado.addElement(linea);
}
}
}

if ((c == 'R') || (c == 'S') || (c == 'T') || (c == 'U'))
{
BufferedReader f5 = new BufferedReader(new FileReader(file5));
while ((linea = f5.readLine()) != null)
{
linea2 = cogeCampo(1, linea);
if (serie.compareTo(linea2) == 0)
{
resultado.addElement(linea);
}
}
}

if ((c == 'V') || (c == 'W') || (c == 'X') || (c == 'Y') || (c == 'Z'))
{
BufferedReader f6 = new BufferedReader(new FileReader(file6));
while ((linea = f6.readLine()) != null)
{
linea2 = cogeCampo(1, linea);
if (serie.compareTo(linea2) == 0)
{
resultado.addElement(linea);
}
}
}

colocaEnTabla(resultado);
}
catch (java.io.IOException ioex) {status("Error de entrada / salida");}
catch (NullPointerException npex){status("Excepción de puntero nulo");}
}

//******************* muestraIncompletas(String recortado) **********
public void muestraIncompletas(String series)
{
try
{
char c = series.charAt(0);
String linea = "";
String linea2 = "";
Vector resultado = new Vector(0);
Vector devuelvo = new Vector(0);
int total = 0;
int contador = 1;
int actual = 0;

for (int g=0;g<MAX ;g++ )
{
resultado.addElement("nulo");
}

if ((c == 'A') || (c == 'B') || (c == 'C') || (c == 'D'))
{
BufferedReader f1 = new BufferedReader(new FileReader(file1));
while ((linea = f1.readLine()) != null)
{
linea2 = cogeCampo(1, linea);
if (series.compareTo(linea2) == 0)
{
resultado.insertElementAt("" + cogeCampo(2,linea), Integer.parseInt(cogeCampo(2,linea).toString()));
total = Integer.parseInt(cogeCampo(8,linea));
}

}
}

if ((c == 'E') || (c == 'F') || (c == 'G') || (c == 'H'))
{
BufferedReader f2 = new BufferedReader(new FileReader(file2));
while ((linea = f2.readLine()) != null)
{
linea2 = cogeCampo(1, linea);
if (series.compareTo(linea2) == 0)
{
resultado.insertElementAt("" + cogeCampo(2,linea), Integer.parseInt(cogeCampo(2,linea).toString()));
total = Integer.parseInt(cogeCampo(8,linea));
}
}
}

if ((c == 'I') || (c == 'J') || (c == 'K') || (c == 'L'))
{
BufferedReader f3 = new BufferedReader(new FileReader(file3));
while ((linea = f3.readLine()) != null)
{
linea2 = cogeCampo(1, linea);
if (series.compareTo(linea2) == 0)
{
resultado.insertElementAt("" + cogeCampo(2,linea), Integer.parseInt(cogeCampo(2,linea).toString()));
total = Integer.parseInt(cogeCampo(8,linea));
}
}
}

if ((c == 'M') || (c == 'N') || (c == 'O') || (c == 'P') || (c == 'Q'))
{
BufferedReader f4 = new BufferedReader(new FileReader(file4));
while ((linea = f4.readLine()) != null)
{
linea2 = cogeCampo(1, linea);
if (series.compareTo(linea2) == 0)
{
resultado.insertElementAt("" + cogeCampo(2,linea), Integer.parseInt(cogeCampo(2,linea).toString()));
total = Integer.parseInt(cogeCampo(8,linea));
}
}
}

if ((c == 'R') || (c == 'S') || (c == 'T') || (c == 'U'))
{
BufferedReader f5 = new BufferedReader(new FileReader(file5));
while ((linea = f5.readLine()) != null)
{
linea2 = cogeCampo(1, linea);
if (series.compareTo(linea2) == 0)
{
resultado.insertElementAt("" + cogeCampo(2,linea), Integer.parseInt(cogeCampo(2,linea).toString()));
total = Integer.parseInt(cogeCampo(8,linea));
}
}
}

if ((c == 'V') || (c == 'W') || (c == 'X') || (c == 'Y') || (c == 'Z'))
{
BufferedReader f6 = new BufferedReader(new FileReader(file6));
while ((linea = f6.readLine()) != null)
{
linea2 = cogeCampo(1, linea);
if (series.compareTo(linea2) == 0)
{
resultado.insertElementAt("" + cogeCampo(2,linea), Integer.parseInt(cogeCampo(2,linea).toString()));
total = Integer.parseInt(cogeCampo(8,linea));
}
}
}

Inco.removeAllElements();
for (int o=1; o<=total ;o++ )
{
if (resultado.elementAt(o) == "nulo")
{
devuelvo.addElement("["+series+"]["+o+"][FALTA][FALTA][FALTA][FALTA][FALTA][FALTA][FALTA][FALTA ESTE EPISODIO EN LA SERIE]");
Inco.addElement("" + series);
Inco.addElement("" + o);
}
}

colocaEnTabla(devuelvo);
}
catch (java.io.IOException ioex) {status("Error de entrada / salida");}
catch (NullPointerException npex){status("Excepción de puntero nulo");}
}

//******************* cogeCampo(int campo, String campeador) *********

public String cogeCampo(int campo, String campeador)
{
int aux = 1;
String resultado = "";

switch (campo)
{
case 1: //NOMBRE
while (campeador.charAt(aux) != ']')
{
resultado += campeador.charAt(aux);
aux++;
}
break;

case 2: //EP
for (int i=1; i<2 ; i++ )
{
while (campeador.charAt(aux) != ']')
{ aux++; }
aux+=2;
}
while (campeador.charAt(aux) != ']')
{
resultado += campeador.charAt(aux);
aux++;
}
break;

case 3: //CD
for (int i=1; i<3 ; i++ )
{
while (campeador.charAt(aux) != ']')
{ aux++; }
aux+=2;
}
while (campeador.charAt(aux) != ']')
{
resultado += campeador.charAt(aux);
aux++;
}
break;

case 4: //IDIOMA
for (int i=1; i<4 ; i++ )
{
while (campeador.charAt(aux) != ']')
{ aux++; }
aux+=2;
}
while (campeador.charAt(aux) != ']')
{
resultado += campeador.charAt(aux);
aux++;
}
break;

case 5: //SUBTITULO
for (int i=1; i<5 ; i++ )
{
while (campeador.charAt(aux) != ']')
{ aux++; }
aux+=2;
}
while (campeador.charAt(aux) != ']')
{
resultado += campeador.charAt(aux);
aux++;
}
break;

case 6: //SUBBBER
for (int i=1; i<6 ; i++ )
{
while (campeador.charAt(aux) != ']')
{ aux++; }
aux+=2;
}
while (campeador.charAt(aux) != ']')
{
resultado += campeador.charAt(aux);
aux++;
}
break;

case 7: //FORMATO
for (int i=1; i<7 ; i++ )
{
while (campeador.charAt(aux) != ']')
{ aux++; }
aux+=2;
}
while (campeador.charAt(aux) != ']')
{
resultado += campeador.charAt(aux);
aux++;
}
break;

case 8: //TOTAL
for (int i=1; i<8 ; i++ )
{
while (campeador.charAt(aux) != ']')
{ aux++; }
aux+=2;
}
while (campeador.charAt(aux) != ']')
{
resultado += campeador.charAt(aux);
aux++;
}
break;

case 9: //TAMAÑO
for (int i=1; i<9 ; i++ )
{
while (campeador.charAt(aux) != ']')
{ aux++; }
aux+=2;
}
while (campeador.charAt(aux) != ']')
{
resultado += campeador.charAt(aux);
aux++;
}
break;

case 10: //NOTAS
for (int i=1; i<10 ; i++ )
{
while (campeador.charAt(aux) != ']')
{ aux++; }
aux+=2;
}
while (campeador.charAt(aux) != ']')
{
resultado += campeador.charAt(aux);
aux++;
}
break;
}//switch
return resultado;
}

[walsen]

Al final, en vista de que no llegábamos, se había decidido por esperar dentro del coche. Una chica alta y rubia como ella estaba más que acostumbrada a oír según que cosas a según que horas, pero estando allí sola y siendo ellos cuatro, juzgó que entrar no sería ninguna tontería. Aún así, también desde dentro podía escuchar los lascivos comentarios que aquellos cuatro chicos le estaban dedicando, y lo que más le molestaba: aunque ellos estaban sentados a más de tres metros detrás, le parecía que podía sentir sus, creía, sucias miradas.

[Sunburn]

Voy a petar el foro
Ni siquiera pienso leer

[Hideki]

772 Episodios Online



Bienvenido a Frozen-Layer, somos un grupo dedicado a distribuir series japonesas de animacion (Anime), todos los dias se suben bastantes capitulos a servidores de descarga directa, algunos capitulos debido a su tamaño estan partidos en varios trozos, en la zona de la izquierda puedes ver los capitulos que se han subido hoy y abajo a la derechael numero de megas del dia, y los megas totales. Si tienes algun problema pasate por el foro y te ayudaremos en lo que podamos, si encuentras un archivo que no funciona por favor notificalo tambien en el foro. Bueno, disfruta del anime y colabora en lo que puedas. Un saludo de parte de todo el grupo.
Para navegar por la pagina utiliza el menu desplegable que esta arriba a la izquierda





.:: 25/08/2002 @ 200:00 - Domingo::.

Como podeis ver estrenamos diseño nuevo para la pagina.Parece que eresmas se ha jodido definitivamente asi que funcionan pocas cosas. sobre todo podreis bajar las cosas mas nuevas, pasaros por el foro y coger los enlaces segun se suban las cosas.

El diseño de la pagina lo he hecho en apenas dia y medio asi que igual hay algun fallo. si encontrais algo comentarlo en el foro y comentar tambien si os gusta o no. Nos vemos alli.

[Deadsunrise]

mira la que has liado pedazo cabron.

[Aioria]

buff, esto aunmenta rapidillo

[Sunburn]

Voy a petar el foro
Ni siquiera pienso leer