cnp3-ebook/principles/transport

Exit Zen

18 ../../principles/transport.rst:62

	English If Alice wants to enter the meeting room but does not know the password, her conversation could be as follows : 111/10000 · 111
19 ../../principles/transport.rst:65

	English Alice : `3.1415` 16/10000 · 16
20 ../../principles/transport.rst:66

	English Bob : `This is not the correct password.` 41/10000 · 41
21 ../../principles/transport.rst:68

	English Human conversations can be very formal, e.g. when soldiers communicate with their hierarchy, or informal such as when friends discuss. Computers that communicate are more akin to soldiers and require well-defined rules to ensure a successful exchange of information. There are two types of rules that define how information can be exchanged between computers : 361/10000 · 361
22 ../../principles/transport.rst:70

	English Syntactical rules that precisely define the format of the messages that are exchanged. As computers only process bits, the syntactical rules specify how information is encoded as bit strings. 191/10000 · 191
23 ../../principles/transport.rst:71

	English Organization of the information flow. For many applications, the flow of information must be structured and there are precedence relationships between the different types of information. In the time example above, Alice must greet Bob before asking for the current time. Alice would not ask for the current time first and greet Bob afterwards. Such precedence relationships exist in networked applications as well. For example, a server must receive a username and a valid password before accepting more complex commands from its clients. 538/10000 · 538
24 ../../principles/transport.rst:73

	English Let us first discuss the syntactical rules. We will later explain how the information flow can be organized by analyzing real networked applications. 149/10000 · 149
25 ../../principles/transport.rst:75

	English Application-layer protocols exchange two types of messages. Some protocols such as those used to support electronic mail exchange messages expressed as strings or lines of characters. As the transport layer allows hosts to exchange bytes, they need to agree on a common representation of the characters. The first and simplest method to encode characters is to use the :term:`ASCII` table. :rfc:`20` provides the ASCII table that is used by many protocols on the Internet. For example, the table defines the following binary representations : 542/10000 · 542
26 ../../principles/transport.rst:77

	English `A` : `1000011b` 16/10000 · 16
27 ../../principles/transport.rst:78

	English `0` : `0110000b` 16/10000 · 16
28 ../../principles/transport.rst:79

	English `z` : `1111010b` 16/10000 · 16
29 ../../principles/transport.rst:80

	English `@` : `1000000b` 16/10000 · 16
30 ../../principles/transport.rst:81

	English `space` : `0100000b` 20/10000 · 20
31 ../../principles/transport.rst:83

	English In addition, the :term:`ASCII` table also defines several non-printable or control characters. These characters were designed to allow an application to control a printer or a terminal. These control characters include `CR` and `LF`, that are used to terminate a line, and the `Bell` character which causes the terminal to emit a sound. 336/10000 · 336
32 ../../principles/transport.rst:85

	English `carriage return` (`CR`) : `0001101b` 37/10000 · 37
33 ../../principles/transport.rst:86

	English `line feed` (`LF`) : `0001010b` 31/10000 · 31
34 ../../principles/transport.rst:87

	English `Bell`: `0000111b` 18/10000 · 18
35 ../../principles/transport.rst:89

	English The :term:`ASCII` characters are encoded as a seven bits field, but transmitted as an eight-bits byte whose high order bit is usually set to `0`. Bytes are always transmitted starting from the high order or most significant bit. 228/10000 · 228
36 ../../principles/transport.rst:91

	English Most applications exchange strings that are composed of fixed or variable numbers of characters. A common solution to define the character strings that are acceptable is to define them as a grammar using a Backus-Naur Form (:term:`BNF`) such as the Augmented BNF defined in :rfc:`5234`. A BNF is a set of production rules that generate all valid character strings. For example, consider a networked application that uses two commands, where the user can supply a username and a password. The BNF for this application could be defined as shown in the figure below. 563/10000 · 563
37 ../../principles/transport.rst:97

	English A simple BNF specification 26/10000 · 26

Shortcut	Action
`?`	Open available keyboard shortcuts.
`Alt` + `Home`	Navigate to the first translation in the current search.
`Alt` + `End`	Navigate to the last translation in the current search.
`Alt` + `PageUp` or `Ctrl` + `↑` or `Alt` + `↑` or `Cmd` + `↑` or	Navigate to the previous translation in the current search.
`Alt` + `PageDown` or `Ctrl` + `↓` or `Alt` + `↓` or `Cmd` + `↓` or	Navigate to the next translation in the current search.
`Ctrl` + `Enter` or `Cmd` + `Enter`	Submit current form; this works the same as pressing Save and continue while editing translation.
`Ctrl` + `Shift` + `Enter` or `Cmd` + `Shift` +`Enter`	Unmark translation as Needing edit and submit it.
`Alt` + `Enter` or `Option` + `Enter`	Submit the string as a suggestion; this works the same as pressing Suggest while editing translation.
`Ctrl` + `E` or `Cmd` + `E`	Focus on translation editor.
`Ctrl` + `U` or `Cmd` + `U`	Focus on comment editor.
`Ctrl` + `M` or `Cmd` + `M`	Shows Automatic suggestions tab.
`Ctrl` + `1` to `Ctrl` + `9` or `Cmd` + `1` to `Cmd` + `9`	Copies placeable of a given number from source string.
`Ctrl` + `M` followed by `1` to `9` or `Cmd` + `M` followed by `1` to `9`	Copy the machine translation of a given number to current translation.
`Ctrl` + `I` followed by `1` to `9` or `Cmd` + `I` followed by `1` to `9`	Ignore one item in the list of failing checks.
`Ctrl` + `J` or `Cmd` + `J`	Shows the Nearby strings tab.
`Ctrl` + `S` or `Cmd` + `S`	Focus on search field.
`Ctrl` + `O` or `Cmd` + `O`	Copy the source string.
`Ctrl` + `Y` or `Cmd` + `Y`	Toggle the Needs editing checkbox.
`→`	Browse the next translation string.
`←`	Browse the previous translation string.