Save.Doc Output$, "lex.t", Ansi
document lex$
...
28 KB (4,050 words) - 22:09, 8 November 2022
log.Fatalf("Error getting groups for user %s: %+v", "username", err)
....Dn "o=example.com") (Ldap.typesOnly True) (Attr "uid" := Text.encodeUtf8 "user") []
...
39 KB (4,837 words) - 21:26, 14 March 2024
....Dn "o=example.com") (Ldap.typesOnly True) (Attr "uid" := Text.encodeUtf8 "user") []
LDAPClient.simple_bind(conn, "user", "password")
...
24 KB (3,018 words) - 21:13, 14 March 2024
This also includes arrays of user defined types, using the type definition order from smallest to largest.
(defn lex? [a b]
...
83 KB (9,530 words) - 16:12, 9 January 2024
::* the user input(s) may be in any case (upper/lower/mixed)
::* Write a function to validate if the user "words" (given as input) are valid (in the ''command t
...
170 KB (20,395 words) - 17:10, 10 March 2024
lex) ;; lexical, value is nil
(list (boundp '*dyn*) *dyn* (boundp 'lex) lex)) -> (T NIL NIL NIL)
...
66 KB (9,949 words) - 17:28, 12 June 2024
:or {ordering :lex, column 1}}]
[1 8 3] :lex 1 true</syntaxhighlight>
...
109 KB (14,070 words) - 09:38, 9 January 2024
MODE LEX = PROC (TOK)NUM;
MODE ACTION = UNION(STACKACTION, LEX, MONADIC, DIADIC);
...
246 KB (29,551 words) - 10:11, 9 May 2024
symb = lex() # get next symbol
function lex() {
...
85 KB (10,024 words) - 20:21, 17 March 2024
F lex(input_str)
V tokens = lex(input_str)
...
221 KB (25,359 words) - 21:30, 17 April 2024
<br><b>lex < hello.t | parse | gen | vm</b>
<br><b>lex hello.t lex.out</b>
...
677 KB (80,017 words) - 19:37, 30 May 2024
Write a program that takes four digits, either from user input or by random generation, and computes arithmetic expressions followin
InputBox, NNNN ; user input 4 digits
...
320 KB (37,670 words) - 11:52, 5 November 2023
lex < while.t > while.lex
parse < while.lex > while.ast
...
451 KB (55,045 words) - 20:06, 30 May 2024
$ patscc -O3 -DATS_MEMALLOC_LIBC -o vm vm-postiats.dats -latslib && ./lex < compiler-tests/count.t | ./parse | ./gen | ./vm
if ( line.substr(0, 3) == "lex" ) {
...
429 KB (54,624 words) - 19:43, 30 May 2024
<syntaxhighlight lang="j"> lex =: 1 :'(a[n__a=.m#_.[a=.18!:3$~0)&(4 :''(+/%#)(#~1-128!:5)n__x=.1|.!.y n__
<syntaxhighlight lang="j"> sma =: 5 lex
...
150 KB (17,793 words) - 06:46, 12 May 2024
...osetta Code:randomness|randomly]] chooses and [[task feature::Rosetta Code:user output|displays]] four digits, each from 1 ──► 9 (inclusive) with repetitio
The goal is for the player to [[task feature::Rosetta Code:user input|enter]] an expression that (numerically) evaluates to '''24'''.
...
407 KB (49,374 words) - 10:19, 13 June 2024
...t [[Rosetta Code:AutoGeSHi]], not here. —[[User:Underscore|Underscore]] ([[User talk:Underscore|Talk]])
Also, with the consent of [[User:Short Circuit|Michael Mol]] I added a small snippet within GeSHi to create
...
87 KB (12,277 words) - 10:38, 8 March 2021
<pre>CL-USER(2): (main)
fn lex(input: String) -> Result<Vec<Token>, char> {
...
220 KB (23,431 words) - 12:45, 1 February 2024
'''User defined "typeof" operator''':
...use of "operator overloading" over different types of variables. Hence the user is able to define their own introspecting "typeof" operator.
...
108 KB (14,611 words) - 02:38, 13 March 2024
The user enters a list of up to 10 strings
"sort_idx" slist => reverse( sort( getindices( "sorted" ), lex ) );
...
89 KB (11,124 words) - 21:19, 29 May 2024
