--%>

How does XML maintain white-space in any documents

How does XML maintain white-space in any documents?

E

Expert

Verified

All white-space, with TAB characters, line breaks and normal spaces, until now between structural tools where no text can ever show, is passed by the parser not changed to the application (formatter, converter, browser and viewer), identifying the context wherein the white-space was determined (data content, element content or mixed content, when this information is obtainable to the parser, for example: from a DTD or Schema). It means this is the application's responsibility to make a decision what to do with space, except the parsers:

• Insignificant white-space among structural tools (space that occurs where only tool content is allowed, for example: between other tools, where text data never happens) will find as passed to the application (within SGML this white-space gets suppressed, that is why you can put all which extra space in HTML documents and not worry regarding it)

• Important white-space (space which occurs within elements which can contain text and markup mixed together, usually mixed content or PCDATA) will still get passed to the application exactly as under SGML. It is the application's responsibility to handle it correctly.

• The parser should inform the application that white-space has happened in element content, when it can detect this. SGML user will recognize that such information is not in the ESIS, but this is in the Grove.

< chapter >
< title >
My title for
Chapter 3.
< /title >
< para >
text
< /para >
< /chapter >

In the illustration above, the application will obtain all the pretty-printing linebreaks, TABs, and spaces among the elements. This is the function of the application, not the parser, to decide that type of white-space to discard and that to retain. Several XML applications have configurable options to permit programmers or users to control how that white-space is handled.

   Related Questions in Programming Languages

  • Q : What is BLAST in program model checking

    What is BLAST in program model checking: The abbreviation is Berkeley Lazy Abstraction Software Verification Tool (BLAST) is a software model checker for C programs. The main goal of BLAST (BLAST website) is to be able to check that software satisfies

  • Q : Define Heap Abstractions Heap

    Heap Abstractions: The class abstractions that we discussed above are obtained by abstracting each field of base type. The number of instances of that particular class still needs to be bounded; this results in an under-approximation that is still use

  • Q : Questions on java class Array 1.

    1. Suppose we have a class A which has a constructor that takes a single integer. (a) After the following statements have been executed, how many A objects will exist

  • Q : Define Keyword Keyword : They are

    Keyword: They are reserve word containing special meaning of the language and cannot be employed as identifier.

  • Q : Throughout system testing the

    Someone complains that throughout system testing the application frequently crashes. What probable process problem does which indicate?

  • Q : What is Universal Character Set or UTF

    UTF: Universal Character Set (abbreviated as UCS) Transformation Format. The format for symbolizing multibyte characters which is compatible with programs and file systems which were only made to handle single byte characters.

  • Q : Explain Assignment operator Assignment

    Assignment operator: The operator (=) employed to store the value of an expression into the variable, for example: Variable = expression; The right-hand

  • Q : Different services provided by DLR to

    Give details about the different services that are provided by DLR to CLR?

  • Q : What is Protected access Protected

    Protected access: Protected access is accessible to a class member prefixed with protected access modifier. This member is accessible to all classes stated within the enclosing package, and any sub-classes expanding the enclosing class.

  • Q : What is Bounded repetition Bounded

    Bounded repetition: The Repetition where statements within a loop's body are executed a fixed number of times and the number of times is established whenever the loop began. There is no control structure in Java which guarantees the bounded repetition